./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-lamport.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 973a4664d6c84bf0de00be540a2393be94f2df0f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-08 14:35:54,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-08 14:35:54,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-08 14:35:54,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-08 14:35:54,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-08 14:35:54,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-08 14:35:54,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-08 14:35:54,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-08 14:35:54,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-08 14:35:54,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-08 14:35:54,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-08 14:35:54,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-08 14:35:54,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-08 14:35:54,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-08 14:35:54,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-08 14:35:54,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-08 14:35:54,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-08 14:35:54,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-08 14:35:54,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-08 14:35:54,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-08 14:35:54,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-08 14:35:54,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-08 14:35:54,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-08 14:35:54,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-08 14:35:54,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-08 14:35:54,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-08 14:35:54,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-08 14:35:54,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-08 14:35:54,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-08 14:35:54,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-08 14:35:54,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-08 14:35:54,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-08 14:35:54,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-08 14:35:54,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-08 14:35:54,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-08 14:35:54,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-08 14:35:54,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-08 14:35:54,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-08 14:35:54,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-08 14:35:54,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-08 14:35:54,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-08 14:35:54,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-08 14:35:54,381 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-08 14:35:54,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-08 14:35:54,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-08 14:35:54,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-08 14:35:54,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-08 14:35:54,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-08 14:35:54,384 INFO L138 SettingsManager]: * Use SBE=true [2021-10-08 14:35:54,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-08 14:35:54,384 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-08 14:35:54,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-08 14:35:54,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-08 14:35:54,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-08 14:35:54,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-08 14:35:54,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-08 14:35:54,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-08 14:35:54,386 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-08 14:35:54,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-08 14:35:54,386 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-08 14:35:54,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-08 14:35:54,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-08 14:35:54,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-08 14:35:54,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-08 14:35:54,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 14:35:54,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-08 14:35:54,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-08 14:35:54,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-08 14:35:54,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-08 14:35:54,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-08 14:35:54,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-08 14:35:54,388 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-08 14:35:54,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 973a4664d6c84bf0de00be540a2393be94f2df0f [2021-10-08 14:35:54,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-08 14:35:54,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-08 14:35:54,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-08 14:35:54,879 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-08 14:35:54,879 INFO L275 PluginConnector]: CDTParser initialized [2021-10-08 14:35:54,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2021-10-08 14:35:54,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/401c11a39/3fbec73f578b44bc866513cbc5a1abbb/FLAG3c01ca633 [2021-10-08 14:35:55,649 INFO L306 CDTParser]: Found 1 translation units. [2021-10-08 14:35:55,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2021-10-08 14:35:55,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/401c11a39/3fbec73f578b44bc866513cbc5a1abbb/FLAG3c01ca633 [2021-10-08 14:35:56,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/401c11a39/3fbec73f578b44bc866513cbc5a1abbb [2021-10-08 14:35:56,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-08 14:35:56,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-08 14:35:56,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-08 14:35:56,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-08 14:35:56,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-08 14:35:56,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683ceb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56, skipping insertion in model container [2021-10-08 14:35:56,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-08 14:35:56,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-08 14:35:56,256 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c[2883,2896] [2021-10-08 14:35:56,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 14:35:56,276 INFO L203 MainTranslator]: Completed pre-run [2021-10-08 14:35:56,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c[2883,2896] [2021-10-08 14:35:56,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 14:35:56,327 INFO L208 MainTranslator]: Completed translation [2021-10-08 14:35:56,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56 WrapperNode [2021-10-08 14:35:56,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-08 14:35:56,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-08 14:35:56,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-08 14:35:56,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-08 14:35:56,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-08 14:35:56,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-08 14:35:56,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-08 14:35:56,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-08 14:35:56,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-08 14:35:56,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-08 14:35:56,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-08 14:35:56,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-08 14:35:56,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (1/1) ... [2021-10-08 14:35:56,432 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 14:35:56,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 14:35:56,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-08 14:35:56,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-08 14:35:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-08 14:35:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-08 14:35:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-08 14:35:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-08 14:35:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-08 14:35:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-08 14:35:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-08 14:35:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-08 14:35:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-08 14:35:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-08 14:35:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-08 14:35:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-08 14:35:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-08 14:35:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-08 14:35:56,580 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-08 14:35:57,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-08 14:35:57,058 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-10-08 14:35:57,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 02:35:57 BoogieIcfgContainer [2021-10-08 14:35:57,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-08 14:35:57,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-08 14:35:57,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-08 14:35:57,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-08 14:35:57,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.10 02:35:56" (1/3) ... [2021-10-08 14:35:57,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e13e5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 02:35:57, skipping insertion in model container [2021-10-08 14:35:57,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:35:56" (2/3) ... [2021-10-08 14:35:57,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e13e5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 02:35:57, skipping insertion in model container [2021-10-08 14:35:57,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 02:35:57" (3/3) ... [2021-10-08 14:35:57,073 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2021-10-08 14:35:57,079 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-08 14:35:57,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-08 14:35:57,080 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-08 14:35:57,080 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-08 14:35:57,137 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,137 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,137 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,138 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,138 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,138 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,139 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,139 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,139 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,139 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,140 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,140 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,140 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,141 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,141 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,141 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,142 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,142 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,142 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,143 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,143 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,143 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,144 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,144 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,144 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,145 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,145 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,145 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,146 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,146 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,146 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,147 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,147 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,147 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,148 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,148 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,148 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,149 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,149 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,149 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,150 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,150 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,150 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,151 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,151 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,151 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,153 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,153 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,153 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,154 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,154 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,154 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,155 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,155 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,155 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,156 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,156 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,156 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,156 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,157 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,157 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,157 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,158 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,158 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,158 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,159 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,159 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,159 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,160 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,160 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,160 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,161 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,161 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,161 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,162 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,162 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,162 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,163 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,163 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,163 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,163 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,164 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,164 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,164 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,165 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,167 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,168 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,168 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,168 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,169 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,169 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,169 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,170 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,170 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,170 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,171 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,171 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,171 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,172 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,172 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,172 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,173 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,173 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,173 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,174 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,174 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,174 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,175 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,176 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,176 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,180 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,180 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,181 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,181 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,181 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,186 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,186 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,187 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,187 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,187 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,189 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,190 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,190 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,190 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,190 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,191 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:35:57,200 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-08 14:35:57,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-08 14:35:57,264 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-08 14:35:57,264 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-08 14:35:57,286 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-08 14:35:57,299 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 213 transitions, 450 flow [2021-10-08 14:35:57,303 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 213 transitions, 450 flow [2021-10-08 14:35:57,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 209 places, 213 transitions, 450 flow [2021-10-08 14:35:57,471 INFO L129 PetriNetUnfolder]: 14/210 cut-off events. [2021-10-08 14:35:57,472 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-08 14:35:57,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 210 events. 14/210 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 171. Up to 2 conditions per place. [2021-10-08 14:35:57,491 INFO L116 LiptonReduction]: Number of co-enabled transitions 5124 [2021-10-08 14:36:06,905 INFO L131 LiptonReduction]: Checked pairs total: 12820 [2021-10-08 14:36:06,906 INFO L133 LiptonReduction]: Total number of compositions: 226 [2021-10-08 14:36:06,916 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 44 transitions, 112 flow [2021-10-08 14:36:06,981 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 797 states, 796 states have (on average 3.1030150753768844) internal successors, (2470), 796 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 797 states, 796 states have (on average 3.1030150753768844) internal successors, (2470), 796 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-08 14:36:07,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:07,019 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:07,019 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2052537682, now seen corresponding path program 1 times [2021-10-08 14:36:07,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:07,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279388843] [2021-10-08 14:36:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:07,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 14:36:07,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:07,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279388843] [2021-10-08 14:36:07,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279388843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:07,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:07,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 14:36:07,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736371201] [2021-10-08 14:36:07,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-08 14:36:07,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-08 14:36:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 14:36:07,289 INFO L87 Difference]: Start difference. First operand has 797 states, 796 states have (on average 3.1030150753768844) internal successors, (2470), 796 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:07,339 INFO L93 Difference]: Finished difference Result 797 states and 2194 transitions. [2021-10-08 14:36:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-08 14:36:07,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-08 14:36:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:07,375 INFO L225 Difference]: With dead ends: 797 [2021-10-08 14:36:07,375 INFO L226 Difference]: Without dead ends: 797 [2021-10-08 14:36:07,377 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 14:36:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-10-08 14:36:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2021-10-08 14:36:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 2.7562814070351758) internal successors, (2194), 796 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 2194 transitions. [2021-10-08 14:36:07,528 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 2194 transitions. Word has length 19 [2021-10-08 14:36:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:07,529 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 2194 transitions. [2021-10-08 14:36:07,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 2194 transitions. [2021-10-08 14:36:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-08 14:36:07,539 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:07,539 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:07,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-08 14:36:07,540 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash -805456859, now seen corresponding path program 1 times [2021-10-08 14:36:07,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:07,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261535546] [2021-10-08 14:36:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:07,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 14:36:07,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:07,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261535546] [2021-10-08 14:36:07,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261535546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:07,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:07,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 14:36:07,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389889582] [2021-10-08 14:36:07,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 14:36:07,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 14:36:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 14:36:07,828 INFO L87 Difference]: Start difference. First operand 797 states and 2194 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:07,875 INFO L93 Difference]: Finished difference Result 798 states and 2195 transitions. [2021-10-08 14:36:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 14:36:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-08 14:36:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:07,885 INFO L225 Difference]: With dead ends: 798 [2021-10-08 14:36:07,886 INFO L226 Difference]: Without dead ends: 798 [2021-10-08 14:36:07,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 14:36:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-10-08 14:36:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2021-10-08 14:36:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 2.754077791718946) internal successors, (2195), 797 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2195 transitions. [2021-10-08 14:36:07,930 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2195 transitions. Word has length 35 [2021-10-08 14:36:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:07,931 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 2195 transitions. [2021-10-08 14:36:07,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2195 transitions. [2021-10-08 14:36:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:07,935 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:07,935 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:07,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-08 14:36:07,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:07,938 INFO L82 PathProgramCache]: Analyzing trace with hash -673467912, now seen corresponding path program 1 times [2021-10-08 14:36:07,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:07,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847960075] [2021-10-08 14:36:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:07,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:08,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:08,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847960075] [2021-10-08 14:36:08,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847960075] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:08,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:08,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:08,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585428807] [2021-10-08 14:36:08,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:08,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:08,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:08,283 INFO L87 Difference]: Start difference. First operand 798 states and 2195 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:08,832 INFO L93 Difference]: Finished difference Result 1231 states and 3299 transitions. [2021-10-08 14:36:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:36:08,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:08,842 INFO L225 Difference]: With dead ends: 1231 [2021-10-08 14:36:08,842 INFO L226 Difference]: Without dead ends: 1132 [2021-10-08 14:36:08,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 203.6ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-08 14:36:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-10-08 14:36:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 928. [2021-10-08 14:36:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 2.7227615965480045) internal successors, (2524), 927 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2524 transitions. [2021-10-08 14:36:08,885 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2524 transitions. Word has length 36 [2021-10-08 14:36:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:08,886 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 2524 transitions. [2021-10-08 14:36:08,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2524 transitions. [2021-10-08 14:36:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:08,891 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:08,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:08,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-08 14:36:08,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2003366322, now seen corresponding path program 2 times [2021-10-08 14:36:08,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:08,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221962863] [2021-10-08 14:36:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:08,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:09,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:09,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221962863] [2021-10-08 14:36:09,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221962863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:09,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:09,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:09,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392454927] [2021-10-08 14:36:09,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:09,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:09,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:09,218 INFO L87 Difference]: Start difference. First operand 928 states and 2524 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:09,682 INFO L93 Difference]: Finished difference Result 1239 states and 3302 transitions. [2021-10-08 14:36:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-08 14:36:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:09,692 INFO L225 Difference]: With dead ends: 1239 [2021-10-08 14:36:09,693 INFO L226 Difference]: Without dead ends: 1196 [2021-10-08 14:36:09,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 245.0ms TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-10-08 14:36:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-10-08 14:36:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 942. [2021-10-08 14:36:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 2.7173219978746013) internal successors, (2557), 941 states have internal predecessors, (2557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2557 transitions. [2021-10-08 14:36:09,731 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2557 transitions. Word has length 36 [2021-10-08 14:36:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:09,732 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 2557 transitions. [2021-10-08 14:36:09,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2557 transitions. [2021-10-08 14:36:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:09,738 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:09,741 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:09,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-08 14:36:09,742 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash -458326370, now seen corresponding path program 3 times [2021-10-08 14:36:09,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:09,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077209787] [2021-10-08 14:36:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:09,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:10,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:10,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077209787] [2021-10-08 14:36:10,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077209787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:10,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:10,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:10,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080766410] [2021-10-08 14:36:10,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:10,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:10,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:10,034 INFO L87 Difference]: Start difference. First operand 942 states and 2557 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:10,648 INFO L93 Difference]: Finished difference Result 1203 states and 3230 transitions. [2021-10-08 14:36:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-08 14:36:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:10,661 INFO L225 Difference]: With dead ends: 1203 [2021-10-08 14:36:10,661 INFO L226 Difference]: Without dead ends: 1168 [2021-10-08 14:36:10,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 257.9ms TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2021-10-08 14:36:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2021-10-08 14:36:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 956. [2021-10-08 14:36:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 2.712041884816754) internal successors, (2590), 955 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2590 transitions. [2021-10-08 14:36:10,700 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2590 transitions. Word has length 36 [2021-10-08 14:36:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:10,703 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 2590 transitions. [2021-10-08 14:36:10,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2590 transitions. [2021-10-08 14:36:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:10,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:10,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-08 14:36:10,709 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1891494438, now seen corresponding path program 4 times [2021-10-08 14:36:10,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:10,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798510186] [2021-10-08 14:36:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:10,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:10,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:10,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798510186] [2021-10-08 14:36:10,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798510186] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:10,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:10,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:10,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775654648] [2021-10-08 14:36:10,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:10,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:10,988 INFO L87 Difference]: Start difference. First operand 956 states and 2590 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:11,521 INFO L93 Difference]: Finished difference Result 1187 states and 3188 transitions. [2021-10-08 14:36:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:36:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:11,529 INFO L225 Difference]: With dead ends: 1187 [2021-10-08 14:36:11,530 INFO L226 Difference]: Without dead ends: 987 [2021-10-08 14:36:11,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 215.2ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-08 14:36:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-10-08 14:36:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 827. [2021-10-08 14:36:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 2.734866828087167) internal successors, (2259), 826 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2259 transitions. [2021-10-08 14:36:11,561 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2259 transitions. Word has length 36 [2021-10-08 14:36:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:11,561 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 2259 transitions. [2021-10-08 14:36:11,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2259 transitions. [2021-10-08 14:36:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:11,565 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:11,565 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:11,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-08 14:36:11,566 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1218862088, now seen corresponding path program 5 times [2021-10-08 14:36:11,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:11,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013686468] [2021-10-08 14:36:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:11,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:11,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:11,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013686468] [2021-10-08 14:36:11,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013686468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:11,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:11,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:11,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187986703] [2021-10-08 14:36:11,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:11,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:11,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:11,752 INFO L87 Difference]: Start difference. First operand 827 states and 2259 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:12,195 INFO L93 Difference]: Finished difference Result 1082 states and 2841 transitions. [2021-10-08 14:36:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:36:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:12,204 INFO L225 Difference]: With dead ends: 1082 [2021-10-08 14:36:12,204 INFO L226 Difference]: Without dead ends: 983 [2021-10-08 14:36:12,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 203.8ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-10-08 14:36:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-08 14:36:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 841. [2021-10-08 14:36:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 2.7142857142857144) internal successors, (2280), 840 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2280 transitions. [2021-10-08 14:36:12,238 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2280 transitions. Word has length 36 [2021-10-08 14:36:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:12,238 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 2280 transitions. [2021-10-08 14:36:12,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2280 transitions. [2021-10-08 14:36:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:12,242 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:12,242 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:12,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-08 14:36:12,243 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1196016654, now seen corresponding path program 6 times [2021-10-08 14:36:12,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:12,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720788426] [2021-10-08 14:36:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:12,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:12,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:12,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720788426] [2021-10-08 14:36:12,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720788426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:12,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:12,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:12,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403378306] [2021-10-08 14:36:12,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:36:12,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:36:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:36:12,341 INFO L87 Difference]: Start difference. First operand 841 states and 2280 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:12,470 INFO L93 Difference]: Finished difference Result 1511 states and 4015 transitions. [2021-10-08 14:36:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:36:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:12,481 INFO L225 Difference]: With dead ends: 1511 [2021-10-08 14:36:12,481 INFO L226 Difference]: Without dead ends: 1416 [2021-10-08 14:36:12,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:36:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2021-10-08 14:36:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 936. [2021-10-08 14:36:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 2.6705882352941175) internal successors, (2497), 935 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 2497 transitions. [2021-10-08 14:36:12,521 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 2497 transitions. Word has length 36 [2021-10-08 14:36:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:12,521 INFO L470 AbstractCegarLoop]: Abstraction has 936 states and 2497 transitions. [2021-10-08 14:36:12,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 2497 transitions. [2021-10-08 14:36:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:12,525 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:12,525 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:12,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-08 14:36:12,526 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash 93835768, now seen corresponding path program 7 times [2021-10-08 14:36:12,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:12,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989318731] [2021-10-08 14:36:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:12,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:12,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:12,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989318731] [2021-10-08 14:36:12,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989318731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:12,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:12,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:12,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582792324] [2021-10-08 14:36:12,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:12,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:12,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:12,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:12,681 INFO L87 Difference]: Start difference. First operand 936 states and 2497 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:13,011 INFO L93 Difference]: Finished difference Result 1345 states and 3385 transitions. [2021-10-08 14:36:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:13,018 INFO L225 Difference]: With dead ends: 1345 [2021-10-08 14:36:13,018 INFO L226 Difference]: Without dead ends: 1181 [2021-10-08 14:36:13,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 106.1ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-10-08 14:36:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 921. [2021-10-08 14:36:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 2.657608695652174) internal successors, (2445), 920 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 2445 transitions. [2021-10-08 14:36:13,055 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 2445 transitions. Word has length 36 [2021-10-08 14:36:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:13,055 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 2445 transitions. [2021-10-08 14:36:13,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 2445 transitions. [2021-10-08 14:36:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:13,059 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:13,059 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:13,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-08 14:36:13,060 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2031119864, now seen corresponding path program 8 times [2021-10-08 14:36:13,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:13,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831569441] [2021-10-08 14:36:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:13,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:13,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:13,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831569441] [2021-10-08 14:36:13,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831569441] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:13,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:13,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:13,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873936535] [2021-10-08 14:36:13,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:13,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:13,195 INFO L87 Difference]: Start difference. First operand 921 states and 2445 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:13,499 INFO L93 Difference]: Finished difference Result 1120 states and 2832 transitions. [2021-10-08 14:36:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:36:13,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:13,507 INFO L225 Difference]: With dead ends: 1120 [2021-10-08 14:36:13,508 INFO L226 Difference]: Without dead ends: 870 [2021-10-08 14:36:13,508 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 118.3ms TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-10-08 14:36:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-10-08 14:36:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 758. [2021-10-08 14:36:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 2.6605019815059445) internal successors, (2014), 757 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2014 transitions. [2021-10-08 14:36:13,535 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2014 transitions. Word has length 36 [2021-10-08 14:36:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:13,536 INFO L470 AbstractCegarLoop]: Abstraction has 758 states and 2014 transitions. [2021-10-08 14:36:13,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2014 transitions. [2021-10-08 14:36:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:13,539 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:13,539 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:13,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-08 14:36:13,540 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -428314304, now seen corresponding path program 9 times [2021-10-08 14:36:13,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:13,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098323081] [2021-10-08 14:36:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:13,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:13,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:13,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098323081] [2021-10-08 14:36:13,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098323081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:13,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:13,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:13,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439952879] [2021-10-08 14:36:13,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:36:13,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:13,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:36:13,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:36:13,660 INFO L87 Difference]: Start difference. First operand 758 states and 2014 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:13,796 INFO L93 Difference]: Finished difference Result 1424 states and 3786 transitions. [2021-10-08 14:36:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-08 14:36:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:13,806 INFO L225 Difference]: With dead ends: 1424 [2021-10-08 14:36:13,806 INFO L226 Difference]: Without dead ends: 1274 [2021-10-08 14:36:13,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-08 14:36:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2021-10-08 14:36:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 764. [2021-10-08 14:36:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 2.655307994757536) internal successors, (2026), 763 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2026 transitions. [2021-10-08 14:36:13,837 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2026 transitions. Word has length 36 [2021-10-08 14:36:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:13,837 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 2026 transitions. [2021-10-08 14:36:13,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2026 transitions. [2021-10-08 14:36:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:13,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:13,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:13,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-08 14:36:13,841 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1123724514, now seen corresponding path program 10 times [2021-10-08 14:36:13,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:13,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046953572] [2021-10-08 14:36:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:13,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:13,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:13,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046953572] [2021-10-08 14:36:13,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046953572] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:13,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:13,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:13,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579166159] [2021-10-08 14:36:13,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:36:13,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:36:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:36:13,943 INFO L87 Difference]: Start difference. First operand 764 states and 2026 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:14,094 INFO L93 Difference]: Finished difference Result 1304 states and 3444 transitions. [2021-10-08 14:36:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:36:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:14,103 INFO L225 Difference]: With dead ends: 1304 [2021-10-08 14:36:14,103 INFO L226 Difference]: Without dead ends: 1184 [2021-10-08 14:36:14,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 73.2ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-08 14:36:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2021-10-08 14:36:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 782. [2021-10-08 14:36:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 2.6402048655569783) internal successors, (2062), 781 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2062 transitions. [2021-10-08 14:36:14,135 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 2062 transitions. Word has length 36 [2021-10-08 14:36:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:14,135 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 2062 transitions. [2021-10-08 14:36:14,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 2062 transitions. [2021-10-08 14:36:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:14,139 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:14,139 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:14,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-08 14:36:14,140 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1531567790, now seen corresponding path program 11 times [2021-10-08 14:36:14,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:14,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059488150] [2021-10-08 14:36:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:14,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:14,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:14,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059488150] [2021-10-08 14:36:14,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059488150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:14,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:14,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 14:36:14,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189595664] [2021-10-08 14:36:14,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 14:36:14,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:14,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 14:36:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 14:36:14,209 INFO L87 Difference]: Start difference. First operand 782 states and 2062 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:14,223 INFO L93 Difference]: Finished difference Result 776 states and 2038 transitions. [2021-10-08 14:36:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 14:36:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:14,230 INFO L225 Difference]: With dead ends: 776 [2021-10-08 14:36:14,230 INFO L226 Difference]: Without dead ends: 745 [2021-10-08 14:36:14,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 14:36:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-10-08 14:36:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2021-10-08 14:36:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 2.646505376344086) internal successors, (1969), 744 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1969 transitions. [2021-10-08 14:36:14,256 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1969 transitions. Word has length 36 [2021-10-08 14:36:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:14,256 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 1969 transitions. [2021-10-08 14:36:14,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1969 transitions. [2021-10-08 14:36:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:14,260 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:14,260 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:14,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-08 14:36:14,261 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -43022050, now seen corresponding path program 12 times [2021-10-08 14:36:14,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:14,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243263432] [2021-10-08 14:36:14,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:14,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:14,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:14,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243263432] [2021-10-08 14:36:14,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243263432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:14,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:14,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:14,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207456491] [2021-10-08 14:36:14,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:14,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:14,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:14,509 INFO L87 Difference]: Start difference. First operand 745 states and 1969 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:15,024 INFO L93 Difference]: Finished difference Result 976 states and 2485 transitions. [2021-10-08 14:36:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:36:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:15,032 INFO L225 Difference]: With dead ends: 976 [2021-10-08 14:36:15,032 INFO L226 Difference]: Without dead ends: 901 [2021-10-08 14:36:15,033 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 243.3ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-08 14:36:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2021-10-08 14:36:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 745. [2021-10-08 14:36:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 2.5766129032258065) internal successors, (1917), 744 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1917 transitions. [2021-10-08 14:36:15,059 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1917 transitions. Word has length 36 [2021-10-08 14:36:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:15,059 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 1917 transitions. [2021-10-08 14:36:15,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1917 transitions. [2021-10-08 14:36:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:15,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:15,062 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:15,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-08 14:36:15,063 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1661155112, now seen corresponding path program 13 times [2021-10-08 14:36:15,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:15,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654165229] [2021-10-08 14:36:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:15,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:15,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:15,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654165229] [2021-10-08 14:36:15,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654165229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:15,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:15,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:15,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75706823] [2021-10-08 14:36:15,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:15,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:15,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:15,347 INFO L87 Difference]: Start difference. First operand 745 states and 1917 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:15,836 INFO L93 Difference]: Finished difference Result 932 states and 2348 transitions. [2021-10-08 14:36:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-08 14:36:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:15,843 INFO L225 Difference]: With dead ends: 932 [2021-10-08 14:36:15,843 INFO L226 Difference]: Without dead ends: 909 [2021-10-08 14:36:15,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 276.1ms TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-10-08 14:36:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-10-08 14:36:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 751. [2021-10-08 14:36:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 2.570666666666667) internal successors, (1928), 750 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1928 transitions. [2021-10-08 14:36:15,869 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1928 transitions. Word has length 36 [2021-10-08 14:36:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:15,869 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 1928 transitions. [2021-10-08 14:36:15,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1928 transitions. [2021-10-08 14:36:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:15,872 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:15,873 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:15,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-08 14:36:15,873 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash 172119492, now seen corresponding path program 14 times [2021-10-08 14:36:15,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:15,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046320365] [2021-10-08 14:36:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:15,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:16,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:16,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046320365] [2021-10-08 14:36:16,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046320365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:16,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:16,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:16,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206077414] [2021-10-08 14:36:16,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:16,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:16,098 INFO L87 Difference]: Start difference. First operand 751 states and 1928 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:16,623 INFO L93 Difference]: Finished difference Result 912 states and 2316 transitions. [2021-10-08 14:36:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-08 14:36:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:16,631 INFO L225 Difference]: With dead ends: 912 [2021-10-08 14:36:16,631 INFO L226 Difference]: Without dead ends: 893 [2021-10-08 14:36:16,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 288.1ms TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2021-10-08 14:36:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-10-08 14:36:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 757. [2021-10-08 14:36:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 756 states have (on average 2.564814814814815) internal successors, (1939), 756 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1939 transitions. [2021-10-08 14:36:16,684 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1939 transitions. Word has length 36 [2021-10-08 14:36:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:16,684 INFO L470 AbstractCegarLoop]: Abstraction has 757 states and 1939 transitions. [2021-10-08 14:36:16,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1939 transitions. [2021-10-08 14:36:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:16,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:16,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:16,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-08 14:36:16,688 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1261048576, now seen corresponding path program 15 times [2021-10-08 14:36:16,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:16,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064322117] [2021-10-08 14:36:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:16,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 14:36:17,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:17,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064322117] [2021-10-08 14:36:17,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064322117] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 14:36:17,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037974572] [2021-10-08 14:36:17,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-08 14:36:17,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 14:36:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 14:36:17,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 14:36:17,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-08 14:36:17,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-10-08 14:36:17,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 14:36:17,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjunts are in the unsatisfiable core [2021-10-08 14:36:17,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 14:36:17,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 922 [2021-10-08 14:36:17,852 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-08 14:36:17,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-10-08 14:36:17,914 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-08 14:36:17,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-10-08 14:36:18,056 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-08 14:36:18,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2021-10-08 14:36:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:18,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037974572] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:18,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 14:36:18,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2021-10-08 14:36:18,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23993968] [2021-10-08 14:36:18,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-08 14:36:18,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-08 14:36:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-10-08 14:36:18,074 INFO L87 Difference]: Start difference. First operand 757 states and 1939 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:18,669 INFO L93 Difference]: Finished difference Result 904 states and 2298 transitions. [2021-10-08 14:36:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:36:18,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:18,675 INFO L225 Difference]: With dead ends: 904 [2021-10-08 14:36:18,675 INFO L226 Difference]: Without dead ends: 761 [2021-10-08 14:36:18,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 535.6ms TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2021-10-08 14:36:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-10-08 14:36:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 649. [2021-10-08 14:36:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 2.5925925925925926) internal successors, (1680), 648 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1680 transitions. [2021-10-08 14:36:18,712 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1680 transitions. Word has length 36 [2021-10-08 14:36:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:18,715 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 1680 transitions. [2021-10-08 14:36:18,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1680 transitions. [2021-10-08 14:36:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:18,721 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:18,721 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:18,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-08 14:36:18,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 14:36:18,936 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1182749456, now seen corresponding path program 16 times [2021-10-08 14:36:18,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:18,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112461290] [2021-10-08 14:36:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:18,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 14:36:19,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:19,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112461290] [2021-10-08 14:36:19,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112461290] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 14:36:19,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898048358] [2021-10-08 14:36:19,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-08 14:36:19,349 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 14:36:19,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 14:36:19,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 14:36:19,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-08 14:36:19,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-08 14:36:19,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 14:36:19,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjunts are in the unsatisfiable core [2021-10-08 14:36:19,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 14:36:19,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 353 [2021-10-08 14:36:19,722 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-08 14:36:19,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-10-08 14:36:19,771 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-08 14:36:19,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-10-08 14:36:20,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-08 14:36:20,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2021-10-08 14:36:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:20,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898048358] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:20,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 14:36:20,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2021-10-08 14:36:20,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993526549] [2021-10-08 14:36:20,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-08 14:36:20,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:20,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-08 14:36:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-10-08 14:36:20,143 INFO L87 Difference]: Start difference. First operand 649 states and 1680 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:20,832 INFO L93 Difference]: Finished difference Result 804 states and 2016 transitions. [2021-10-08 14:36:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:36:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:20,838 INFO L225 Difference]: With dead ends: 804 [2021-10-08 14:36:20,838 INFO L226 Difference]: Without dead ends: 686 [2021-10-08 14:36:20,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 614.3ms TimeCoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2021-10-08 14:36:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-08 14:36:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 554. [2021-10-08 14:36:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 2.6925858951175408) internal successors, (1489), 553 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1489 transitions. [2021-10-08 14:36:20,856 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1489 transitions. Word has length 36 [2021-10-08 14:36:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:20,857 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 1489 transitions. [2021-10-08 14:36:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1489 transitions. [2021-10-08 14:36:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:20,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:20,859 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:20,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-08 14:36:21,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-08 14:36:21,073 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 627104842, now seen corresponding path program 17 times [2021-10-08 14:36:21,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:21,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467871406] [2021-10-08 14:36:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:21,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:21,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:21,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467871406] [2021-10-08 14:36:21,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467871406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:21,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:21,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:21,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134416102] [2021-10-08 14:36:21,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:36:21,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:36:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:36:21,176 INFO L87 Difference]: Start difference. First operand 554 states and 1489 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:21,322 INFO L93 Difference]: Finished difference Result 1088 states and 2877 transitions. [2021-10-08 14:36:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:36:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:21,338 INFO L225 Difference]: With dead ends: 1088 [2021-10-08 14:36:21,338 INFO L226 Difference]: Without dead ends: 938 [2021-10-08 14:36:21,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 102.0ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:36:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2021-10-08 14:36:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 524. [2021-10-08 14:36:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 2.6749521988527722) internal successors, (1399), 523 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1399 transitions. [2021-10-08 14:36:21,372 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1399 transitions. Word has length 36 [2021-10-08 14:36:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:21,372 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 1399 transitions. [2021-10-08 14:36:21,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1399 transitions. [2021-10-08 14:36:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:21,377 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:21,378 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:21,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-08 14:36:21,378 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:21,379 INFO L82 PathProgramCache]: Analyzing trace with hash -68305368, now seen corresponding path program 18 times [2021-10-08 14:36:21,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:21,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463590966] [2021-10-08 14:36:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:21,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:21,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:21,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463590966] [2021-10-08 14:36:21,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463590966] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:21,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:21,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:21,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285308905] [2021-10-08 14:36:21,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:36:21,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:36:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:36:21,486 INFO L87 Difference]: Start difference. First operand 524 states and 1399 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:21,591 INFO L93 Difference]: Finished difference Result 656 states and 1735 transitions. [2021-10-08 14:36:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-08 14:36:21,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:21,595 INFO L225 Difference]: With dead ends: 656 [2021-10-08 14:36:21,595 INFO L226 Difference]: Without dead ends: 518 [2021-10-08 14:36:21,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-08 14:36:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-10-08 14:36:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2021-10-08 14:36:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.6711798839458414) internal successors, (1381), 517 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1381 transitions. [2021-10-08 14:36:21,610 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1381 transitions. Word has length 36 [2021-10-08 14:36:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:21,610 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 1381 transitions. [2021-10-08 14:36:21,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1381 transitions. [2021-10-08 14:36:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:21,613 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:21,613 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:21,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-08 14:36:21,613 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:21,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash -274465078, now seen corresponding path program 19 times [2021-10-08 14:36:21,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:21,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493897754] [2021-10-08 14:36:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:21,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:21,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:21,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493897754] [2021-10-08 14:36:21,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493897754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:21,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:21,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:21,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127168975] [2021-10-08 14:36:21,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:36:21,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:36:21,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:36:21,722 INFO L87 Difference]: Start difference. First operand 518 states and 1381 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:21,825 INFO L93 Difference]: Finished difference Result 334 states and 837 transitions. [2021-10-08 14:36:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-08 14:36:21,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:21,827 INFO L225 Difference]: With dead ends: 334 [2021-10-08 14:36:21,828 INFO L226 Difference]: Without dead ends: 334 [2021-10-08 14:36:21,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-08 14:36:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-10-08 14:36:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-10-08 14:36:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.5135135135135136) internal successors, (837), 333 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 837 transitions. [2021-10-08 14:36:21,838 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 837 transitions. Word has length 36 [2021-10-08 14:36:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:21,838 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 837 transitions. [2021-10-08 14:36:21,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 837 transitions. [2021-10-08 14:36:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:21,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:21,841 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:21,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-08 14:36:21,841 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash 500322596, now seen corresponding path program 20 times [2021-10-08 14:36:21,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:21,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439638747] [2021-10-08 14:36:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:21,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:21,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:21,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439638747] [2021-10-08 14:36:21,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439638747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:21,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:21,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:36:21,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264764582] [2021-10-08 14:36:21,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:21,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:21,943 INFO L87 Difference]: Start difference. First operand 334 states and 837 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:22,066 INFO L93 Difference]: Finished difference Result 340 states and 843 transitions. [2021-10-08 14:36:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-08 14:36:22,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:22,073 INFO L225 Difference]: With dead ends: 340 [2021-10-08 14:36:22,073 INFO L226 Difference]: Without dead ends: 286 [2021-10-08 14:36:22,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 93.3ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:36:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-10-08 14:36:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2021-10-08 14:36:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 2.431578947368421) internal successors, (693), 285 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 693 transitions. [2021-10-08 14:36:22,081 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 693 transitions. Word has length 36 [2021-10-08 14:36:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:22,082 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 693 transitions. [2021-10-08 14:36:22,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 693 transitions. [2021-10-08 14:36:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:22,084 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:22,084 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:22,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-08 14:36:22,084 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1927643536, now seen corresponding path program 21 times [2021-10-08 14:36:22,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:22,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220482431] [2021-10-08 14:36:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:22,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:22,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:22,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220482431] [2021-10-08 14:36:22,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220482431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:22,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:22,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:22,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117228941] [2021-10-08 14:36:22,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:22,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:22,216 INFO L87 Difference]: Start difference. First operand 286 states and 693 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:22,474 INFO L93 Difference]: Finished difference Result 343 states and 798 transitions. [2021-10-08 14:36:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:36:22,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:22,481 INFO L225 Difference]: With dead ends: 343 [2021-10-08 14:36:22,481 INFO L226 Difference]: Without dead ends: 248 [2021-10-08 14:36:22,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 122.9ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-08 14:36:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-10-08 14:36:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.331983805668016) internal successors, (576), 247 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 576 transitions. [2021-10-08 14:36:22,489 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 576 transitions. Word has length 36 [2021-10-08 14:36:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:22,489 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 576 transitions. [2021-10-08 14:36:22,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 576 transitions. [2021-10-08 14:36:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:22,491 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:22,491 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:22,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-08 14:36:22,491 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -626698386, now seen corresponding path program 22 times [2021-10-08 14:36:22,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:22,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605987638] [2021-10-08 14:36:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:22,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:22,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:22,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605987638] [2021-10-08 14:36:22,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605987638] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:22,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:22,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:22,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060574299] [2021-10-08 14:36:22,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:22,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:22,708 INFO L87 Difference]: Start difference. First operand 248 states and 576 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:22,930 INFO L93 Difference]: Finished difference Result 297 states and 663 transitions. [2021-10-08 14:36:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:22,933 INFO L225 Difference]: With dead ends: 297 [2021-10-08 14:36:22,933 INFO L226 Difference]: Without dead ends: 240 [2021-10-08 14:36:22,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 134.1ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-08 14:36:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-10-08 14:36:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 2.301255230125523) internal successors, (550), 239 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 550 transitions. [2021-10-08 14:36:22,940 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 550 transitions. Word has length 36 [2021-10-08 14:36:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:22,941 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 550 transitions. [2021-10-08 14:36:22,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 550 transitions. [2021-10-08 14:36:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:22,942 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:22,942 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:22,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-08 14:36:22,943 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1320499290, now seen corresponding path program 23 times [2021-10-08 14:36:22,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:22,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667240702] [2021-10-08 14:36:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:22,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:23,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:23,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667240702] [2021-10-08 14:36:23,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667240702] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:23,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:23,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:23,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502528566] [2021-10-08 14:36:23,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:23,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:23,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:23,080 INFO L87 Difference]: Start difference. First operand 240 states and 550 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:23,332 INFO L93 Difference]: Finished difference Result 321 states and 729 transitions. [2021-10-08 14:36:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:36:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:23,333 INFO L225 Difference]: With dead ends: 321 [2021-10-08 14:36:23,333 INFO L226 Difference]: Without dead ends: 272 [2021-10-08 14:36:23,334 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 132.9ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-08 14:36:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2021-10-08 14:36:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.306772908366534) internal successors, (579), 251 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 579 transitions. [2021-10-08 14:36:23,340 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 579 transitions. Word has length 36 [2021-10-08 14:36:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:23,341 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 579 transitions. [2021-10-08 14:36:23,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 579 transitions. [2021-10-08 14:36:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:23,344 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:23,344 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:23,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-08 14:36:23,345 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1528175984, now seen corresponding path program 24 times [2021-10-08 14:36:23,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:23,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364654630] [2021-10-08 14:36:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:23,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:23,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:23,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364654630] [2021-10-08 14:36:23,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364654630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:23,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:23,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:23,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687170199] [2021-10-08 14:36:23,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:23,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:23,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:23,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:23,515 INFO L87 Difference]: Start difference. First operand 252 states and 579 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:23,792 INFO L93 Difference]: Finished difference Result 321 states and 740 transitions. [2021-10-08 14:36:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:36:23,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:23,794 INFO L225 Difference]: With dead ends: 321 [2021-10-08 14:36:23,794 INFO L226 Difference]: Without dead ends: 297 [2021-10-08 14:36:23,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 122.1ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-10-08 14:36:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-10-08 14:36:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.3614864864864864) internal successors, (699), 296 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 699 transitions. [2021-10-08 14:36:23,804 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 699 transitions. Word has length 36 [2021-10-08 14:36:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:23,805 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 699 transitions. [2021-10-08 14:36:23,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 699 transitions. [2021-10-08 14:36:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:23,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:23,810 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:23,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-08 14:36:23,811 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -32875230, now seen corresponding path program 25 times [2021-10-08 14:36:23,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:23,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753313745] [2021-10-08 14:36:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:23,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:23,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:23,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753313745] [2021-10-08 14:36:23,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753313745] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:23,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:23,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:23,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426758342] [2021-10-08 14:36:23,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:23,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:23,946 INFO L87 Difference]: Start difference. First operand 297 states and 699 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:24,192 INFO L93 Difference]: Finished difference Result 310 states and 714 transitions. [2021-10-08 14:36:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:24,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:24,194 INFO L225 Difference]: With dead ends: 310 [2021-10-08 14:36:24,194 INFO L226 Difference]: Without dead ends: 294 [2021-10-08 14:36:24,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 116.8ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-10-08 14:36:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-10-08 14:36:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.361774744027304) internal successors, (692), 293 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 692 transitions. [2021-10-08 14:36:24,202 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 692 transitions. Word has length 36 [2021-10-08 14:36:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:24,203 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 692 transitions. [2021-10-08 14:36:24,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 692 transitions. [2021-10-08 14:36:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:24,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:24,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:24,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-08 14:36:24,205 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash -41235824, now seen corresponding path program 26 times [2021-10-08 14:36:24,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:24,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002712081] [2021-10-08 14:36:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:24,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:24,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:24,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002712081] [2021-10-08 14:36:24,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002712081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:24,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:24,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:24,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482359931] [2021-10-08 14:36:24,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:24,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:24,350 INFO L87 Difference]: Start difference. First operand 294 states and 692 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:24,586 INFO L93 Difference]: Finished difference Result 309 states and 710 transitions. [2021-10-08 14:36:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:36:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:24,588 INFO L225 Difference]: With dead ends: 309 [2021-10-08 14:36:24,588 INFO L226 Difference]: Without dead ends: 291 [2021-10-08 14:36:24,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 112.8ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-10-08 14:36:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-10-08 14:36:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-10-08 14:36:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.3620689655172415) internal successors, (685), 290 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 685 transitions. [2021-10-08 14:36:24,596 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 685 transitions. Word has length 36 [2021-10-08 14:36:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:24,596 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 685 transitions. [2021-10-08 14:36:24,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 685 transitions. [2021-10-08 14:36:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:24,597 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:24,597 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:24,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-08 14:36:24,598 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash -597745654, now seen corresponding path program 27 times [2021-10-08 14:36:24,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:24,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449218195] [2021-10-08 14:36:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:24,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:24,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:24,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449218195] [2021-10-08 14:36:24,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449218195] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:24,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:24,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-08 14:36:24,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162591204] [2021-10-08 14:36:24,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 14:36:24,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 14:36:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:36:24,727 INFO L87 Difference]: Start difference. First operand 291 states and 685 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:24,937 INFO L93 Difference]: Finished difference Result 332 states and 754 transitions. [2021-10-08 14:36:24,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:24,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:24,939 INFO L225 Difference]: With dead ends: 332 [2021-10-08 14:36:24,939 INFO L226 Difference]: Without dead ends: 171 [2021-10-08 14:36:24,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 99.2ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:36:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-10-08 14:36:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-10-08 14:36:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.176470588235294) internal successors, (370), 170 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 370 transitions. [2021-10-08 14:36:24,944 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 370 transitions. Word has length 36 [2021-10-08 14:36:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:24,944 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 370 transitions. [2021-10-08 14:36:24,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 370 transitions. [2021-10-08 14:36:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:24,945 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:24,945 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:24,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-08 14:36:24,946 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash -92207668, now seen corresponding path program 28 times [2021-10-08 14:36:24,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:24,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883785090] [2021-10-08 14:36:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:24,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:25,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:25,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883785090] [2021-10-08 14:36:25,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883785090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:25,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:25,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:25,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001983549] [2021-10-08 14:36:25,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:25,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:25,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:25,117 INFO L87 Difference]: Start difference. First operand 171 states and 370 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:25,417 INFO L93 Difference]: Finished difference Result 212 states and 439 transitions. [2021-10-08 14:36:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:36:25,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:25,419 INFO L225 Difference]: With dead ends: 212 [2021-10-08 14:36:25,419 INFO L226 Difference]: Without dead ends: 163 [2021-10-08 14:36:25,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 197.3ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-10-08 14:36:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-08 14:36:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-10-08 14:36:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.123456790123457) internal successors, (344), 162 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 344 transitions. [2021-10-08 14:36:25,426 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 344 transitions. Word has length 36 [2021-10-08 14:36:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:25,426 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 344 transitions. [2021-10-08 14:36:25,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 344 transitions. [2021-10-08 14:36:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:25,428 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:25,428 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:25,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-08 14:36:25,429 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash -370024178, now seen corresponding path program 29 times [2021-10-08 14:36:25,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:25,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038559516] [2021-10-08 14:36:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:25,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:25,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:25,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038559516] [2021-10-08 14:36:25,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038559516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:25,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:25,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:25,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151118650] [2021-10-08 14:36:25,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:25,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:25,637 INFO L87 Difference]: Start difference. First operand 163 states and 344 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:25,961 INFO L93 Difference]: Finished difference Result 174 states and 356 transitions. [2021-10-08 14:36:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:36:25,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:25,962 INFO L225 Difference]: With dead ends: 174 [2021-10-08 14:36:25,962 INFO L226 Difference]: Without dead ends: 147 [2021-10-08 14:36:25,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 201.5ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-08 14:36:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-08 14:36:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-10-08 14:36:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.1164383561643834) internal successors, (309), 146 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 309 transitions. [2021-10-08 14:36:25,967 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 309 transitions. Word has length 36 [2021-10-08 14:36:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:25,968 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 309 transitions. [2021-10-08 14:36:25,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 309 transitions. [2021-10-08 14:36:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:25,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:25,969 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:25,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-08 14:36:25,969 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1931075392, now seen corresponding path program 30 times [2021-10-08 14:36:25,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:25,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907236782] [2021-10-08 14:36:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:25,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:26,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:26,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907236782] [2021-10-08 14:36:26,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907236782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:26,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:26,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:26,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042793593] [2021-10-08 14:36:26,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:26,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:26,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:26,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:26,136 INFO L87 Difference]: Start difference. First operand 147 states and 309 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:26,424 INFO L93 Difference]: Finished difference Result 160 states and 324 transitions. [2021-10-08 14:36:26,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:26,425 INFO L225 Difference]: With dead ends: 160 [2021-10-08 14:36:26,425 INFO L226 Difference]: Without dead ends: 143 [2021-10-08 14:36:26,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 185.1ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-10-08 14:36:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-08 14:36:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-10-08 14:36:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.112676056338028) internal successors, (300), 142 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 300 transitions. [2021-10-08 14:36:26,430 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 300 transitions. Word has length 36 [2021-10-08 14:36:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:26,430 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 300 transitions. [2021-10-08 14:36:26,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 300 transitions. [2021-10-08 14:36:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:26,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:26,431 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:26,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-08 14:36:26,431 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1939435986, now seen corresponding path program 31 times [2021-10-08 14:36:26,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:26,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110774257] [2021-10-08 14:36:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:26,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:26,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:26,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110774257] [2021-10-08 14:36:26,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110774257] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:26,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:26,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:26,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767311919] [2021-10-08 14:36:26,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:26,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:26,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:26,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:26,600 INFO L87 Difference]: Start difference. First operand 143 states and 300 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:26,876 INFO L93 Difference]: Finished difference Result 158 states and 318 transitions. [2021-10-08 14:36:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:26,877 INFO L225 Difference]: With dead ends: 158 [2021-10-08 14:36:26,877 INFO L226 Difference]: Without dead ends: 139 [2021-10-08 14:36:26,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 177.4ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-08 14:36:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-10-08 14:36:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-10-08 14:36:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.108695652173913) internal successors, (291), 138 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 291 transitions. [2021-10-08 14:36:26,882 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 291 transitions. Word has length 36 [2021-10-08 14:36:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:26,882 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 291 transitions. [2021-10-08 14:36:26,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 291 transitions. [2021-10-08 14:36:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-08 14:36:26,883 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:36:26,883 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 14:36:26,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-08 14:36:26,884 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:36:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:36:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1799021480, now seen corresponding path program 32 times [2021-10-08 14:36:26,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:36:26,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587226400] [2021-10-08 14:36:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:36:26,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:36:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:36:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 14:36:27,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:36:27,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587226400] [2021-10-08 14:36:27,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587226400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:36:27,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:36:27,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-08 14:36:27,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068219813] [2021-10-08 14:36:27,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-08 14:36:27,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:36:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-08 14:36:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-08 14:36:27,059 INFO L87 Difference]: Start difference. First operand 139 states and 291 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:36:27,325 INFO L93 Difference]: Finished difference Result 138 states and 290 transitions. [2021-10-08 14:36:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:36:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-08 14:36:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:36:27,326 INFO L225 Difference]: With dead ends: 138 [2021-10-08 14:36:27,326 INFO L226 Difference]: Without dead ends: 0 [2021-10-08 14:36:27,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 181.3ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-08 14:36:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-08 14:36:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-08 14:36:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-08 14:36:27,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2021-10-08 14:36:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:36:27,328 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-08 14:36:27,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 14:36:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-08 14:36:27,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-08 14:36:27,331 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-08 14:36:27,332 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-08 14:36:27,332 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-08 14:36:27,333 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-08 14:36:27,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-08 14:36:27,339 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-08 14:36:27,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-08 14:36:27,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.10 02:36:27 BasicIcfg [2021-10-08 14:36:27,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-08 14:36:27,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-08 14:36:27,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-08 14:36:27,343 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-08 14:36:27,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 02:35:57" (3/4) ... [2021-10-08 14:36:27,347 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-08 14:36:27,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-08 14:36:27,356 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-08 14:36:27,356 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-08 14:36:27,363 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2021-10-08 14:36:27,363 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-08 14:36:27,364 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-08 14:36:27,364 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-08 14:36:27,412 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-08 14:36:27,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-08 14:36:27,414 INFO L168 Benchmark]: Toolchain (without parser) took 31396.24 ms. Allocated memory was 58.7 MB in the beginning and 220.2 MB in the end (delta: 161.5 MB). Free memory was 34.6 MB in the beginning and 173.8 MB in the end (delta: -139.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,414 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory was 21.3 MB in the beginning and 21.3 MB in the end (delta: 31.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-08 14:36:27,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.91 ms. Allocated memory is still 58.7 MB. Free memory was 34.1 MB in the beginning and 36.2 MB in the end (delta: -2.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.27 ms. Allocated memory is still 58.7 MB. Free memory was 36.2 MB in the beginning and 34.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,416 INFO L168 Benchmark]: Boogie Preprocessor took 34.98 ms. Allocated memory is still 58.7 MB. Free memory was 34.1 MB in the beginning and 32.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,416 INFO L168 Benchmark]: RCFGBuilder took 645.54 ms. Allocated memory is still 58.7 MB. Free memory was 32.5 MB in the beginning and 29.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,417 INFO L168 Benchmark]: TraceAbstraction took 30278.67 ms. Allocated memory was 58.7 MB in the beginning and 220.2 MB in the end (delta: 161.5 MB). Free memory was 28.9 MB in the beginning and 178.0 MB in the end (delta: -149.1 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,417 INFO L168 Benchmark]: Witness Printer took 70.03 ms. Allocated memory is still 220.2 MB. Free memory was 178.0 MB in the beginning and 173.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-08 14:36:27,420 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.25 ms. Allocated memory is still 44.0 MB. Free memory was 21.3 MB in the beginning and 21.3 MB in the end (delta: 31.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 301.91 ms. Allocated memory is still 58.7 MB. Free memory was 34.1 MB in the beginning and 36.2 MB in the end (delta: -2.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.27 ms. Allocated memory is still 58.7 MB. Free memory was 36.2 MB in the beginning and 34.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.98 ms. Allocated memory is still 58.7 MB. Free memory was 34.1 MB in the beginning and 32.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 645.54 ms. Allocated memory is still 58.7 MB. Free memory was 32.5 MB in the beginning and 29.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30278.67 ms. Allocated memory was 58.7 MB in the beginning and 220.2 MB in the end (delta: 161.5 MB). Free memory was 28.9 MB in the beginning and 178.0 MB in the end (delta: -149.1 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. * Witness Printer took 70.03 ms. Allocated memory is still 220.2 MB. Free memory was 178.0 MB in the beginning and 173.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9603.1ms, 209 PlacesBefore, 49 PlacesAfterwards, 213 TransitionsBefore, 44 TransitionsAfterwards, 5124 CoEnabledTransitionPairs, 8 FixpointIterations, 107 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 25 ConcurrentYvCompositions, 9 ChoiceCompositions, 226 TotalNumberOfCompositions, 12820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8042, positive: 7729, positive conditional: 0, positive unconditional: 7729, negative: 313, negative conditional: 0, negative unconditional: 313, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4191, positive: 4110, positive conditional: 0, positive unconditional: 4110, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4191, positive: 4065, positive conditional: 0, positive unconditional: 4065, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 126, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 123, negative conditional: 0, negative unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8042, positive: 3619, positive conditional: 0, positive unconditional: 3619, negative: 232, negative conditional: 0, negative unconditional: 232, unknown: 4191, unknown conditional: 0, unknown unconditional: 4191] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - 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: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 271 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 30083.8ms, OverallIterations: 34, TraceHistogramMax: 1, EmptinessCheckTime: 126.6ms, AutomataDifference: 10523.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9716.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2072 SDtfs, 4658 SDslu, 9397 SDs, 0 SdLazy, 7801 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4990.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 639 GetRequests, 84 SyntacticMatches, 9 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 5669.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=5, InterpolantAutomatonStates: 392, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 831.7ms AutomataMinimizationTime, 34 MinimizatonAttempts, 3864 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 136.1ms SsaConstructionTime, 1847.7ms SatisfiabilityAnalysisTime, 5828.8ms InterpolantComputationTime, 1278 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1242 ConstructedInterpolants, 14 QuantifiedInterpolants, 10726 SizeOfPredicates, 40 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 32/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-08 14:36:27,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...