./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:32:02,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:32:02,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:32:02,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:32:02,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:32:02,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:32:02,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:32:02,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:32:02,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:32:02,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:32:02,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:32:02,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:32:02,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:32:02,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:32:02,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:32:02,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:32:02,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:32:02,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:32:02,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:32:02,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:32:02,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:32:02,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:32:02,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:32:02,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:32:02,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:32:02,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:32:02,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:32:02,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:32:02,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:32:02,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:32:02,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:32:02,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:32:02,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:32:02,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:32:02,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:32:02,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:32:02,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:32:02,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:32:02,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:32:02,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:32:02,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:32:02,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:32:02,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:32:02,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:32:02,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:32:02,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:32:02,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:32:02,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:32:02,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:32:02,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:32:02,406 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:32:02,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:32:02,407 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:32:02,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:32:02,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:32:02,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:32:02,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:32:02,408 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:32:02,408 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:32:02,409 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:32:02,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:32:02,409 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:32:02,409 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:32:02,409 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:32:02,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:32:02,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:32:02,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:32:02,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:32:02,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:32:02,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:32:02,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:32:02,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:32:02,411 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:32:02,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d [2021-12-22 16:32:02,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:32:02,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:32:02,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:32:02,638 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:32:02,639 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:32:02,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2021-12-22 16:32:02,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d3d0c18/9c5ae3a47aad423db3fb662b7c9c2342/FLAG30313ac91 [2021-12-22 16:32:03,159 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:32:03,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2021-12-22 16:32:03,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d3d0c18/9c5ae3a47aad423db3fb662b7c9c2342/FLAG30313ac91 [2021-12-22 16:32:03,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d3d0c18/9c5ae3a47aad423db3fb662b7c9c2342 [2021-12-22 16:32:03,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:32:03,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:32:03,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:32:03,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:32:03,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:32:03,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581803c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03, skipping insertion in model container [2021-12-22 16:32:03,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:32:03,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:32:03,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:32:03,990 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:32:04,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:32:04,061 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:32:04,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04 WrapperNode [2021-12-22 16:32:04,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:32:04,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:32:04,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:32:04,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:32:04,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,133 INFO L137 Inliner]: procedures = 127, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2021-12-22 16:32:04,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:32:04,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:32:04,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:32:04,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:32:04,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:32:04,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:32:04,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:32:04,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:32:04,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (1/1) ... [2021-12-22 16:32:04,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:32:04,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:04,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:32:04,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:32:04,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:32:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:32:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:32:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:32:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:32:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:32:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:32:04,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:32:04,339 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:32:04,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:32:04,763 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:32:04,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:32:04,770 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-22 16:32:04,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:32:04 BoogieIcfgContainer [2021-12-22 16:32:04,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:32:04,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:32:04,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:32:04,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:32:04,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:32:03" (1/3) ... [2021-12-22 16:32:04,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e00625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:32:04, skipping insertion in model container [2021-12-22 16:32:04,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:04" (2/3) ... [2021-12-22 16:32:04,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e00625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:32:04, skipping insertion in model container [2021-12-22 16:32:04,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:32:04" (3/3) ... [2021-12-22 16:32:04,784 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_3lvl.i [2021-12-22 16:32:04,791 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:32:04,792 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-12-22 16:32:04,825 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:32:04,830 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-12-22 16:32:04,830 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-12-22 16:32:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:32:04,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:04,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:32:04,850 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:32:04,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:04,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350632207] [2021-12-22 16:32:04,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:04,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:05,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:05,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350632207] [2021-12-22 16:32:05,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350632207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:05,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:05,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:05,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627733109] [2021-12-22 16:32:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:05,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:05,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:05,049 INFO L87 Difference]: Start difference. First operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:05,252 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2021-12-22 16:32:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-22 16:32:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:05,263 INFO L225 Difference]: With dead ends: 192 [2021-12-22 16:32:05,264 INFO L226 Difference]: Without dead ends: 190 [2021-12-22 16:32:05,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:05,269 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:05,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 105 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-22 16:32:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2021-12-22 16:32:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 84 states have (on average 2.011904761904762) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2021-12-22 16:32:05,321 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 3 [2021-12-22 16:32:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:05,321 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2021-12-22 16:32:05,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2021-12-22 16:32:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:32:05,322 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:05,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:32:05,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:32:05,322 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:32:05,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:05,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299351769] [2021-12-22 16:32:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:05,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:05,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299351769] [2021-12-22 16:32:05,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299351769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:05,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:05,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:05,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098807861] [2021-12-22 16:32:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:05,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:05,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:05,403 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:05,525 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2021-12-22 16:32:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:05,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-22 16:32:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:05,529 INFO L225 Difference]: With dead ends: 159 [2021-12-22 16:32:05,530 INFO L226 Difference]: Without dead ends: 159 [2021-12-22 16:32:05,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:05,536 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:05,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-22 16:32:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-12-22 16:32:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 84 states have (on average 2.0) internal successors, (168), 158 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2021-12-22 16:32:05,554 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 3 [2021-12-22 16:32:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:05,555 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2021-12-22 16:32:05,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2021-12-22 16:32:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-22 16:32:05,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:05,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-22 16:32:05,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:32:05,557 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2021-12-22 16:32:05,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441755939] [2021-12-22 16:32:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:05,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:05,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441755939] [2021-12-22 16:32:05,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441755939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:05,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:05,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:05,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338969442] [2021-12-22 16:32:05,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:05,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:05,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:05,669 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:05,939 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2021-12-22 16:32:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:05,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-22 16:32:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:05,941 INFO L225 Difference]: With dead ends: 181 [2021-12-22 16:32:05,941 INFO L226 Difference]: Without dead ends: 181 [2021-12-22 16:32:05,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:05,943 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 185 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:05,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 119 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-22 16:32:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2021-12-22 16:32:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 150 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2021-12-22 16:32:05,950 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 5 [2021-12-22 16:32:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:05,950 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2021-12-22 16:32:05,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2021-12-22 16:32:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:32:05,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:05,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:05,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:32:05,952 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-22 16:32:05,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:05,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860275483] [2021-12-22 16:32:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:05,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:06,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860275483] [2021-12-22 16:32:06,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860275483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:06,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376947424] [2021-12-22 16:32:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:06,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:06,040 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,205 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2021-12-22 16:32:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:32:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,207 INFO L225 Difference]: With dead ends: 150 [2021-12-22 16:32:06,207 INFO L226 Difference]: Without dead ends: 150 [2021-12-22 16:32:06,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:06,208 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 11 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 384 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-22 16:32:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-22 16:32:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 149 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2021-12-22 16:32:06,224 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 11 [2021-12-22 16:32:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,225 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2021-12-22 16:32:06,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2021-12-22 16:32:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:32:06,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:32:06,226 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-22 16:32:06,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428015089] [2021-12-22 16:32:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:06,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428015089] [2021-12-22 16:32:06,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428015089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:06,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248539573] [2021-12-22 16:32:06,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:06,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:06,344 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,533 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-12-22 16:32:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:32:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,535 INFO L225 Difference]: With dead ends: 149 [2021-12-22 16:32:06,535 INFO L226 Difference]: Without dead ends: 149 [2021-12-22 16:32:06,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:32:06,536 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 14 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 365 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-22 16:32:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-22 16:32:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 84 states have (on average 1.880952380952381) internal successors, (158), 148 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2021-12-22 16:32:06,540 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 11 [2021-12-22 16:32:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,540 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2021-12-22 16:32:06,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2021-12-22 16:32:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:32:06,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:32:06,541 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545203, now seen corresponding path program 1 times [2021-12-22 16:32:06,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61987674] [2021-12-22 16:32:06,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:06,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61987674] [2021-12-22 16:32:06,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61987674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:06,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630582375] [2021-12-22 16:32:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:06,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:06,600 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,699 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-12-22 16:32:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:06,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:32:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,700 INFO L225 Difference]: With dead ends: 148 [2021-12-22 16:32:06,700 INFO L226 Difference]: Without dead ends: 148 [2021-12-22 16:32:06,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:06,704 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 487 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-22 16:32:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-22 16:32:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 84 states have (on average 1.869047619047619) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-12-22 16:32:06,713 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 12 [2021-12-22 16:32:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,713 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-12-22 16:32:06,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-12-22 16:32:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:32:06,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:32:06,715 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545204, now seen corresponding path program 1 times [2021-12-22 16:32:06,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854391416] [2021-12-22 16:32:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:06,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854391416] [2021-12-22 16:32:06,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854391416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:06,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763345725] [2021-12-22 16:32:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:06,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:06,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:06,871 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,082 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2021-12-22 16:32:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:32:07,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 16:32:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,083 INFO L225 Difference]: With dead ends: 147 [2021-12-22 16:32:07,083 INFO L226 Difference]: Without dead ends: 147 [2021-12-22 16:32:07,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:07,084 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 480 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-22 16:32:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-12-22 16:32:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.8571428571428572) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2021-12-22 16:32:07,087 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2021-12-22 16:32:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,087 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2021-12-22 16:32:07,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2021-12-22 16:32:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:32:07,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:32:07,088 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash -451673556, now seen corresponding path program 1 times [2021-12-22 16:32:07,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614514977] [2021-12-22 16:32:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:07,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614514977] [2021-12-22 16:32:07,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614514977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:07,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587630617] [2021-12-22 16:32:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:07,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:07,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:07,158 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,263 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2021-12-22 16:32:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 16:32:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,265 INFO L225 Difference]: With dead ends: 146 [2021-12-22 16:32:07,265 INFO L226 Difference]: Without dead ends: 146 [2021-12-22 16:32:07,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:07,266 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 8 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 483 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-22 16:32:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-12-22 16:32:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.8452380952380953) internal successors, (155), 145 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2021-12-22 16:32:07,270 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 13 [2021-12-22 16:32:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,270 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2021-12-22 16:32:07,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2021-12-22 16:32:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:32:07,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:32:07,272 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -451673555, now seen corresponding path program 1 times [2021-12-22 16:32:07,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067477603] [2021-12-22 16:32:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:07,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067477603] [2021-12-22 16:32:07,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067477603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:07,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930557749] [2021-12-22 16:32:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:07,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:07,433 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,628 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2021-12-22 16:32:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:32:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 16:32:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,629 INFO L225 Difference]: With dead ends: 145 [2021-12-22 16:32:07,629 INFO L226 Difference]: Without dead ends: 145 [2021-12-22 16:32:07,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:07,630 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 13 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 476 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-22 16:32:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-12-22 16:32:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.8333333333333333) internal successors, (154), 144 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2021-12-22 16:32:07,633 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 13 [2021-12-22 16:32:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,633 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2021-12-22 16:32:07,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2021-12-22 16:32:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:32:07,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:32:07,634 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -598729444, now seen corresponding path program 1 times [2021-12-22 16:32:07,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454345626] [2021-12-22 16:32:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:07,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454345626] [2021-12-22 16:32:07,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454345626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 16:32:07,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286726942] [2021-12-22 16:32:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 16:32:07,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 16:32:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:32:07,818 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:08,095 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-12-22 16:32:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 16:32:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 16:32:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:08,097 INFO L225 Difference]: With dead ends: 144 [2021-12-22 16:32:08,097 INFO L226 Difference]: Without dead ends: 144 [2021-12-22 16:32:08,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:32:08,098 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:08,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-22 16:32:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-12-22 16:32:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.8214285714285714) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-12-22 16:32:08,101 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 18 [2021-12-22 16:32:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:08,101 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-12-22 16:32:08,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-12-22 16:32:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:32:08,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:08,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:08,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:32:08,102 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash -598729443, now seen corresponding path program 1 times [2021-12-22 16:32:08,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:08,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096930900] [2021-12-22 16:32:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:08,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:08,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:08,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096930900] [2021-12-22 16:32:08,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096930900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:08,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:08,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 16:32:08,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776968668] [2021-12-22 16:32:08,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:08,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 16:32:08,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:08,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 16:32:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:32:08,348 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:08,685 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-22 16:32:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 16:32:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 16:32:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:08,687 INFO L225 Difference]: With dead ends: 143 [2021-12-22 16:32:08,687 INFO L226 Difference]: Without dead ends: 143 [2021-12-22 16:32:08,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:32:08,688 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 23 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:08,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 937 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-22 16:32:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-12-22 16:32:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 142 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2021-12-22 16:32:08,691 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 18 [2021-12-22 16:32:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:08,692 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2021-12-22 16:32:08,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2021-12-22 16:32:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:32:08,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:08,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:08,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:32:08,699 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743565, now seen corresponding path program 1 times [2021-12-22 16:32:08,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236558056] [2021-12-22 16:32:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:08,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:08,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:08,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236558056] [2021-12-22 16:32:08,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236558056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:08,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:08,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:08,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863071483] [2021-12-22 16:32:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:08,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:08,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:08,760 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-22 16:32:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:08,861 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2021-12-22 16:32:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-22 16:32:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:08,863 INFO L225 Difference]: With dead ends: 142 [2021-12-22 16:32:08,863 INFO L226 Difference]: Without dead ends: 142 [2021-12-22 16:32:08,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:08,864 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:08,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 469 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-22 16:32:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-12-22 16:32:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 141 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2021-12-22 16:32:08,868 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2021-12-22 16:32:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:08,868 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2021-12-22 16:32:08,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-22 16:32:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2021-12-22 16:32:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:32:08,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:08,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:08,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:32:08,870 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743564, now seen corresponding path program 1 times [2021-12-22 16:32:08,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:08,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109963586] [2021-12-22 16:32:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:08,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:09,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:09,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109963586] [2021-12-22 16:32:09,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109963586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:09,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:09,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 16:32:09,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242202006] [2021-12-22 16:32:09,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:09,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 16:32:09,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:09,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 16:32:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:32:09,132 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 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-12-22 16:32:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:09,369 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-12-22 16:32:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 16:32:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 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-12-22 16:32:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:09,371 INFO L225 Difference]: With dead ends: 141 [2021-12-22 16:32:09,371 INFO L226 Difference]: Without dead ends: 141 [2021-12-22 16:32:09,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-12-22 16:32:09,372 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:09,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 611 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-22 16:32:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-12-22 16:32:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 140 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2021-12-22 16:32:09,375 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 19 [2021-12-22 16:32:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:09,375 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2021-12-22 16:32:09,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 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-12-22 16:32:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2021-12-22 16:32:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:32:09,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:09,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:09,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:32:09,376 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 146622463, now seen corresponding path program 1 times [2021-12-22 16:32:09,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200153498] [2021-12-22 16:32:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:09,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:09,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:09,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200153498] [2021-12-22 16:32:09,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200153498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:09,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:09,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:09,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710069877] [2021-12-22 16:32:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:09,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:09,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:09,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:09,437 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:09,531 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-12-22 16:32:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:09,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-22 16:32:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:09,532 INFO L225 Difference]: With dead ends: 140 [2021-12-22 16:32:09,533 INFO L226 Difference]: Without dead ends: 140 [2021-12-22 16:32:09,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:09,534 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:09,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 465 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-22 16:32:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-12-22 16:32:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 139 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2021-12-22 16:32:09,538 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 20 [2021-12-22 16:32:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:09,539 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2021-12-22 16:32:09,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2021-12-22 16:32:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:32:09,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:09,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:09,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:32:09,540 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash 146622464, now seen corresponding path program 1 times [2021-12-22 16:32:09,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:09,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419443101] [2021-12-22 16:32:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:09,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:09,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:09,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419443101] [2021-12-22 16:32:09,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419443101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:09,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:09,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 16:32:09,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542846968] [2021-12-22 16:32:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:09,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 16:32:09,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 16:32:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:32:09,808 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:10,133 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-12-22 16:32:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 16:32:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-22 16:32:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:10,134 INFO L225 Difference]: With dead ends: 139 [2021-12-22 16:32:10,134 INFO L226 Difference]: Without dead ends: 139 [2021-12-22 16:32:10,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-12-22 16:32:10,135 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 31 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:10,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 841 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-22 16:32:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-22 16:32:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.7619047619047619) internal successors, (148), 138 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2021-12-22 16:32:10,138 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 20 [2021-12-22 16:32:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:10,138 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2021-12-22 16:32:10,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2021-12-22 16:32:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 16:32:10,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:10,139 INFO L514 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] [2021-12-22 16:32:10,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:32:10,139 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484996, now seen corresponding path program 1 times [2021-12-22 16:32:10,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:10,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593960131] [2021-12-22 16:32:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:10,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:10,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593960131] [2021-12-22 16:32:10,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593960131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:10,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:10,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:10,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581630482] [2021-12-22 16:32:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:10,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:10,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:10,219 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:10,383 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2021-12-22 16:32:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:10,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-22 16:32:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:10,384 INFO L225 Difference]: With dead ends: 200 [2021-12-22 16:32:10,384 INFO L226 Difference]: Without dead ends: 200 [2021-12-22 16:32:10,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:10,385 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 478 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:10,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 172 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-22 16:32:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2021-12-22 16:32:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.7380952380952381) internal successors, (146), 136 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2021-12-22 16:32:10,388 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 25 [2021-12-22 16:32:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:10,389 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2021-12-22 16:32:10,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2021-12-22 16:32:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 16:32:10,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:10,389 INFO L514 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] [2021-12-22 16:32:10,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:32:10,390 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484995, now seen corresponding path program 1 times [2021-12-22 16:32:10,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:10,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005135239] [2021-12-22 16:32:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:10,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:10,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005135239] [2021-12-22 16:32:10,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005135239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:10,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:10,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:10,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940162420] [2021-12-22 16:32:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:10,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:10,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:10,468 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:10,611 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2021-12-22 16:32:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:10,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-22 16:32:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:10,612 INFO L225 Difference]: With dead ends: 171 [2021-12-22 16:32:10,612 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 16:32:10,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:10,613 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 625 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:10,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 134 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 16:32:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2021-12-22 16:32:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 134 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2021-12-22 16:32:10,615 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 25 [2021-12-22 16:32:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:10,616 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2021-12-22 16:32:10,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2021-12-22 16:32:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:32:10,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:10,616 INFO L514 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] [2021-12-22 16:32:10,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:32:10,616 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706153, now seen corresponding path program 1 times [2021-12-22 16:32:10,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:10,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750354857] [2021-12-22 16:32:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:10,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:10,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:10,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750354857] [2021-12-22 16:32:10,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750354857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:10,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:10,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:10,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394188057] [2021-12-22 16:32:10,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:10,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:10,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:10,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:10,674 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:10,818 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-12-22 16:32:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-12-22 16:32:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:10,819 INFO L225 Difference]: With dead ends: 156 [2021-12-22 16:32:10,819 INFO L226 Difference]: Without dead ends: 156 [2021-12-22 16:32:10,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:10,820 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 384 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:10,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 164 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-22 16:32:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2021-12-22 16:32:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2021-12-22 16:32:10,824 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 26 [2021-12-22 16:32:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:10,824 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2021-12-22 16:32:10,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2021-12-22 16:32:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:32:10,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:10,825 INFO L514 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] [2021-12-22 16:32:10,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 16:32:10,826 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706154, now seen corresponding path program 1 times [2021-12-22 16:32:10,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:10,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390419123] [2021-12-22 16:32:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:10,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:10,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390419123] [2021-12-22 16:32:10,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390419123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:10,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:10,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:10,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189350069] [2021-12-22 16:32:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:10,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:10,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:10,912 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:11,058 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-22 16:32:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-12-22 16:32:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:11,059 INFO L225 Difference]: With dead ends: 127 [2021-12-22 16:32:11,059 INFO L226 Difference]: Without dead ends: 127 [2021-12-22 16:32:11,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:11,060 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 378 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:11,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 124 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-22 16:32:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-22 16:32:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.6) internal successors, (136), 126 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2021-12-22 16:32:11,063 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 26 [2021-12-22 16:32:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:11,063 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2021-12-22 16:32:11,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2021-12-22 16:32:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:32:11,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:11,066 INFO L514 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] [2021-12-22 16:32:11,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 16:32:11,067 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699999, now seen corresponding path program 1 times [2021-12-22 16:32:11,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:11,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748134599] [2021-12-22 16:32:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:11,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:11,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748134599] [2021-12-22 16:32:11,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748134599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:11,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:11,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-22 16:32:11,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760988805] [2021-12-22 16:32:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:11,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 16:32:11,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 16:32:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:32:11,399 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:12,224 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2021-12-22 16:32:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 16:32:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-12-22 16:32:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:12,226 INFO L225 Difference]: With dead ends: 209 [2021-12-22 16:32:12,226 INFO L226 Difference]: Without dead ends: 209 [2021-12-22 16:32:12,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-12-22 16:32:12,227 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 562 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:12,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1076 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:32:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-22 16:32:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 128. [2021-12-22 16:32:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2021-12-22 16:32:12,230 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 27 [2021-12-22 16:32:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:12,231 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2021-12-22 16:32:12,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2021-12-22 16:32:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:32:12,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:12,236 INFO L514 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] [2021-12-22 16:32:12,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 16:32:12,236 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699998, now seen corresponding path program 1 times [2021-12-22 16:32:12,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:12,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585052743] [2021-12-22 16:32:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:12,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:12,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:12,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585052743] [2021-12-22 16:32:12,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585052743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:12,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:12,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-22 16:32:12,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691341225] [2021-12-22 16:32:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:12,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 16:32:12,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 16:32:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-12-22 16:32:12,796 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:13,884 INFO L93 Difference]: Finished difference Result 281 states and 306 transitions. [2021-12-22 16:32:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 16:32:13,885 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-12-22 16:32:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:13,886 INFO L225 Difference]: With dead ends: 281 [2021-12-22 16:32:13,886 INFO L226 Difference]: Without dead ends: 281 [2021-12-22 16:32:13,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2021-12-22 16:32:13,887 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 775 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:13,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 1295 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 16:32:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-22 16:32:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 166. [2021-12-22 16:32:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.625) internal successors, (208), 165 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2021-12-22 16:32:13,892 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 27 [2021-12-22 16:32:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:13,892 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2021-12-22 16:32:13,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2021-12-22 16:32:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:32:13,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:13,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:13,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 16:32:13,893 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1235458799, now seen corresponding path program 1 times [2021-12-22 16:32:13,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870119203] [2021-12-22 16:32:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:13,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:13,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870119203] [2021-12-22 16:32:13,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870119203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:13,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:13,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:13,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153646058] [2021-12-22 16:32:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:13,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:13,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:13,942 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:13,999 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2021-12-22 16:32:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:32:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:14,002 INFO L225 Difference]: With dead ends: 165 [2021-12-22 16:32:14,002 INFO L226 Difference]: Without dead ends: 165 [2021-12-22 16:32:14,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:14,003 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 345 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:14,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:32:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-22 16:32:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-12-22 16:32:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6171875) internal successors, (207), 164 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2021-12-22 16:32:14,008 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 29 [2021-12-22 16:32:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:14,008 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2021-12-22 16:32:14,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2021-12-22 16:32:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 16:32:14,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:14,009 INFO L514 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] [2021-12-22 16:32:14,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 16:32:14,009 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814087, now seen corresponding path program 1 times [2021-12-22 16:32:14,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:14,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223558479] [2021-12-22 16:32:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:14,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:14,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:14,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223558479] [2021-12-22 16:32:14,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223558479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:14,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:14,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-22 16:32:14,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546106932] [2021-12-22 16:32:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:14,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 16:32:14,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:14,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 16:32:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-12-22 16:32:14,294 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:14,853 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2021-12-22 16:32:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 16:32:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-12-22 16:32:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:14,854 INFO L225 Difference]: With dead ends: 224 [2021-12-22 16:32:14,855 INFO L226 Difference]: Without dead ends: 224 [2021-12-22 16:32:14,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2021-12-22 16:32:14,856 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 359 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:14,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 954 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-22 16:32:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-12-22 16:32:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.6) internal successors, (216), 171 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2021-12-22 16:32:14,860 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 31 [2021-12-22 16:32:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:14,860 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2021-12-22 16:32:14,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2021-12-22 16:32:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 16:32:14,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:14,861 INFO L514 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] [2021-12-22 16:32:14,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 16:32:14,862 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:14,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814086, now seen corresponding path program 1 times [2021-12-22 16:32:14,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:14,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900834243] [2021-12-22 16:32:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:14,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:15,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:15,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900834243] [2021-12-22 16:32:15,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900834243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:15,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:15,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-22 16:32:15,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494707395] [2021-12-22 16:32:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:15,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 16:32:15,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 16:32:15,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:32:15,330 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:16,121 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2021-12-22 16:32:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 16:32:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-12-22 16:32:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:16,123 INFO L225 Difference]: With dead ends: 224 [2021-12-22 16:32:16,123 INFO L226 Difference]: Without dead ends: 224 [2021-12-22 16:32:16,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-12-22 16:32:16,124 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 429 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:16,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 906 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:32:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-22 16:32:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-12-22 16:32:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5925925925925926) internal successors, (215), 171 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 215 transitions. [2021-12-22 16:32:16,128 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 215 transitions. Word has length 31 [2021-12-22 16:32:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:16,129 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 215 transitions. [2021-12-22 16:32:16,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2021-12-22 16:32:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 16:32:16,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:16,129 INFO L514 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] [2021-12-22 16:32:16,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 16:32:16,130 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1978046457, now seen corresponding path program 1 times [2021-12-22 16:32:16,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:16,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783696465] [2021-12-22 16:32:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:16,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:16,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:16,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783696465] [2021-12-22 16:32:16,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783696465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:16,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:16,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-22 16:32:16,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713181842] [2021-12-22 16:32:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:16,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 16:32:16,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 16:32:16,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-12-22 16:32:16,481 INFO L87 Difference]: Start difference. First operand 172 states and 215 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:17,077 INFO L93 Difference]: Finished difference Result 217 states and 265 transitions. [2021-12-22 16:32:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 16:32:17,078 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-12-22 16:32:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:17,079 INFO L225 Difference]: With dead ends: 217 [2021-12-22 16:32:17,079 INFO L226 Difference]: Without dead ends: 217 [2021-12-22 16:32:17,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2021-12-22 16:32:17,080 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 329 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:17,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 1158 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-22 16:32:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2021-12-22 16:32:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5851851851851853) internal successors, (214), 171 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2021-12-22 16:32:17,084 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 32 [2021-12-22 16:32:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:17,084 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2021-12-22 16:32:17,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2021-12-22 16:32:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 16:32:17,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:17,085 INFO L514 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] [2021-12-22 16:32:17,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 16:32:17,085 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash 190378255, now seen corresponding path program 1 times [2021-12-22 16:32:17,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:17,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717488966] [2021-12-22 16:32:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:17,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:17,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:17,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717488966] [2021-12-22 16:32:17,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717488966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:17,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:17,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:32:17,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782689073] [2021-12-22 16:32:17,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:17,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:32:17,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:32:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:32:17,124 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:17,222 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2021-12-22 16:32:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:32:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-12-22 16:32:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:17,223 INFO L225 Difference]: With dead ends: 189 [2021-12-22 16:32:17,224 INFO L226 Difference]: Without dead ends: 189 [2021-12-22 16:32:17,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:17,224 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:17,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 150 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-22 16:32:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2021-12-22 16:32:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.532846715328467) internal successors, (210), 169 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2021-12-22 16:32:17,228 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 33 [2021-12-22 16:32:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:17,228 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2021-12-22 16:32:17,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2021-12-22 16:32:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 16:32:17,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:17,229 INFO L514 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] [2021-12-22 16:32:17,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 16:32:17,229 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash 190378256, now seen corresponding path program 1 times [2021-12-22 16:32:17,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:17,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535067172] [2021-12-22 16:32:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:17,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:17,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535067172] [2021-12-22 16:32:17,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535067172] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:17,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:17,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-12-22 16:32:17,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283615564] [2021-12-22 16:32:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:17,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-22 16:32:17,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-22 16:32:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-12-22 16:32:17,641 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:18,441 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2021-12-22 16:32:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 16:32:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-12-22 16:32:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:18,442 INFO L225 Difference]: With dead ends: 282 [2021-12-22 16:32:18,443 INFO L226 Difference]: Without dead ends: 282 [2021-12-22 16:32:18,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2021-12-22 16:32:18,444 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 1000 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:18,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 1278 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:32:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-22 16:32:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 183. [2021-12-22 16:32:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.5333333333333334) internal successors, (230), 182 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2021-12-22 16:32:18,448 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 33 [2021-12-22 16:32:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:18,449 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2021-12-22 16:32:18,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2021-12-22 16:32:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 16:32:18,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:18,449 INFO L514 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] [2021-12-22 16:32:18,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-22 16:32:18,450 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 451934574, now seen corresponding path program 1 times [2021-12-22 16:32:18,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:18,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550258343] [2021-12-22 16:32:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:18,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:18,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:18,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550258343] [2021-12-22 16:32:18,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550258343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:18,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:18,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-22 16:32:18,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307914247] [2021-12-22 16:32:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:18,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 16:32:18,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 16:32:18,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-12-22 16:32:18,797 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:19,256 INFO L93 Difference]: Finished difference Result 238 states and 292 transitions. [2021-12-22 16:32:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:32:19,257 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-12-22 16:32:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:19,258 INFO L225 Difference]: With dead ends: 238 [2021-12-22 16:32:19,258 INFO L226 Difference]: Without dead ends: 238 [2021-12-22 16:32:19,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2021-12-22 16:32:19,259 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 405 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:19,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 779 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-22 16:32:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2021-12-22 16:32:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.522875816993464) internal successors, (233), 185 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2021-12-22 16:32:19,263 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2021-12-22 16:32:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:19,264 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2021-12-22 16:32:19,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2021-12-22 16:32:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 16:32:19,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:19,264 INFO L514 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] [2021-12-22 16:32:19,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-22 16:32:19,265 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-12-22 16:32:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1606811227, now seen corresponding path program 1 times [2021-12-22 16:32:19,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:19,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069164342] [2021-12-22 16:32:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:19,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:20,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069164342] [2021-12-22 16:32:20,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069164342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:32:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374134794] [2021-12-22 16:32:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:20,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:32:20,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:20,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:32:20,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 16:32:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:20,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-22 16:32:20,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:20,430 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:20,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2021-12-22 16:32:20,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:20,560 INFO L353 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-22 16:32:20,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-22 16:32:20,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:20,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2021-12-22 16:32:21,088 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:21,089 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 81 [2021-12-22 16:32:21,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-22 16:32:21,201 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:21,202 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 76 [2021-12-22 16:32:21,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-22 16:32:21,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:21,320 INFO L353 Elim1Store]: treesize reduction 78, result has 17.9 percent of original size [2021-12-22 16:32:21,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 61 [2021-12-22 16:32:21,324 INFO L387 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 0 case distinctions, treesize of input 93 treesize of output 89 [2021-12-22 16:32:21,713 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:21,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 119 [2021-12-22 16:32:21,723 INFO L353 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-12-22 16:32:21,724 INFO L387 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 95 treesize of output 91 [2021-12-22 16:32:21,783 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:21,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 112 [2021-12-22 16:32:21,794 INFO L353 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-12-22 16:32:21,795 INFO L387 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 95 treesize of output 91 [2021-12-22 16:32:21,849 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:21,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 105 [2021-12-22 16:32:21,863 INFO L353 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-12-22 16:32:21,863 INFO L387 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 95 treesize of output 91 [2021-12-22 16:32:22,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 88 treesize of output 68 [2021-12-22 16:32:22,477 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-22 16:32:22,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 32 [2021-12-22 16:32:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:22,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:32:22,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) 1)) is different from false [2021-12-22 16:32:22,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2021-12-22 16:32:22,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1279) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2021-12-22 16:32:22,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1279) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1280) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2021-12-22 16:32:22,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2021-12-22 16:32:22,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))))) is different from false [2021-12-22 16:32:22,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2021-12-22 16:32:23,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) 1)) is different from false [2021-12-22 16:32:23,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2021-12-22 16:32:23,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))))) 1)) is different from false [2021-12-22 16:32:23,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))))) 1)) is different from false [2021-12-22 16:32:23,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 644 treesize of output 560 [2021-12-22 16:32:23,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:32:23,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 560 treesize of output 354 [2021-12-22 16:32:23,241 INFO L387 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 170 treesize of output 168 [2021-12-22 16:32:23,246 INFO L387 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 338 treesize of output 334 [2021-12-22 16:32:24,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_26 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse9 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse9 v_arrayElimArr_1)) (.cse7 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse7))) (let ((.cse8 (let ((.cse12 (store .cse13 .cse11 v_ArrVal_1284))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse10 (= .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse1 (and (= (select |c_#valid| (select .cse8 (+ 8 v_arrayElimCell_28))) 1) .cse10)) (.cse2 (not .cse10)) (.cse5 (+ 8 v_arrayElimCell_26)) (.cse0 (= .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (or (and .cse0 (or .cse1 (and .cse2 (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_arrayElimArr_1))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1284)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1))))) (not (= (select v_arrayElimArr_1 .cse5) (select .cse6 .cse7))) (and (or .cse1 (and .cse2 (= (select |c_#valid| (select .cse8 .cse5)) 1))) (not .cse0)))))))))) is different from false [2021-12-22 16:32:26,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_26 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse2 (+ 8 v_arrayElimCell_26))) (let ((.cse15 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse5 (select v_arrayElimArr_1 .cse2))) (let ((.cse16 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse15 .cse5))) (let ((.cse10 (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse16) .cse10 v_arrayElimArr_1))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse15))) (let ((.cse1 (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1284))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse11 (= .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse0 (not .cse11)) (.cse3 (and .cse11 (= (select |c_#valid| (select .cse1 (+ 8 v_arrayElimCell_28))) 1))) (.cse4 (= .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (or (and (or (and .cse0 (= (select |c_#valid| (select .cse1 .cse2)) 1)) .cse3) (not .cse4)) (not (= .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (and (or (and (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select (let ((.cse6 (let ((.cse8 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8 (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26))))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse9) (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_arrayElimArr_1)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8) v_ArrVal_1284))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1)) .cse0) .cse3) .cse4))))))))))) is different from false [2021-12-22 16:32:28,024 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:32:28,025 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 966 treesize of output 600 [2021-12-22 16:32:28,041 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-12-22 16:32:28,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 782 treesize of output 786 [2021-12-22 16:32:28,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:32:28,726 INFO L353 Elim1Store]: treesize reduction 412, result has 49.1 percent of original size [2021-12-22 16:32:28,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 21288 treesize of output 15294 [2021-12-22 16:32:29,612 INFO L353 Elim1Store]: treesize reduction 28, result has 75.2 percent of original size [2021-12-22 16:32:29,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 12748 treesize of output 10798 [2021-12-22 16:32:29,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:32:29,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 10798 treesize of output 10130 [2021-12-22 16:32:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:59,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374134794] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:32:59,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:32:59,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 25] total 71 [2021-12-22 16:32:59,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153766584] [2021-12-22 16:32:59,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:32:59,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-12-22 16:32:59,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-12-22 16:32:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3159, Unknown=48, NotChecked=1638, Total=5112 [2021-12-22 16:32:59,735 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand has 72 states, 71 states have (on average 1.380281690140845) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)