./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/forester-heap/sll-circular-1.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 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 06:00:46,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 06:00:46,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 06:00:46,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 06:00:46,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 06:00:46,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 06:00:46,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 06:00:46,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 06:00:46,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 06:00:46,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 06:00:46,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 06:00:46,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 06:00:46,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 06:00:46,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 06:00:46,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 06:00:46,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 06:00:46,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 06:00:46,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 06:00:46,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 06:00:46,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 06:00:46,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 06:00:46,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 06:00:46,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 06:00:46,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 06:00:46,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 06:00:46,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 06:00:46,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 06:00:46,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 06:00:46,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 06:00:46,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 06:00:46,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 06:00:46,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 06:00:46,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 06:00:46,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 06:00:46,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 06:00:46,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 06:00:46,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 06:00:46,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 06:00:46,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 06:00:46,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 06:00:46,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 06:00:46,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 06:00:46,874 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 06:00:46,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 06:00:46,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 06:00:46,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 06:00:46,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 06:00:46,877 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 06:00:46,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 06:00:46,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 06:00:46,878 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 06:00:46,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 06:00:46,879 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 06:00:46,879 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 06:00:46,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 06:00:46,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 06:00:46,880 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 06:00:46,881 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 06:00:46,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 06:00:46,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 06:00:46,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 06:00:46,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:00:46,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 06:00:46,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 06:00:46,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 06:00:46,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 06:00:46,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 06:00:46,882 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2021-12-16 06:00:47,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 06:00:47,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 06:00:47,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 06:00:47,110 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 06:00:47,112 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 06:00:47,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2021-12-16 06:00:47,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2344c78d/be541023ece749f2b61b4c3bb66d0c60/FLAG2fdea78e3 [2021-12-16 06:00:47,547 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 06:00:47,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2021-12-16 06:00:47,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2344c78d/be541023ece749f2b61b4c3bb66d0c60/FLAG2fdea78e3 [2021-12-16 06:00:47,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2344c78d/be541023ece749f2b61b4c3bb66d0c60 [2021-12-16 06:00:47,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 06:00:47,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 06:00:47,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 06:00:47,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 06:00:47,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 06:00:47,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f11a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47, skipping insertion in model container [2021-12-16 06:00:47,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 06:00:47,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 06:00:48,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2021-12-16 06:00:48,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2021-12-16 06:00:48,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2021-12-16 06:00:48,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:00:48,186 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 06:00:48,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2021-12-16 06:00:48,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2021-12-16 06:00:48,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2021-12-16 06:00:48,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:00:48,252 INFO L208 MainTranslator]: Completed translation [2021-12-16 06:00:48,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48 WrapperNode [2021-12-16 06:00:48,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 06:00:48,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 06:00:48,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 06:00:48,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 06:00:48,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,299 INFO L137 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2021-12-16 06:00:48,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 06:00:48,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 06:00:48,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 06:00:48,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 06:00:48,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 06:00:48,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 06:00:48,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 06:00:48,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 06:00:48,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (1/1) ... [2021-12-16 06:00:48,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:00:48,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:48,365 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-16 06:00:48,381 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-16 06:00:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 06:00:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 06:00:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 06:00:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 06:00:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 06:00:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 06:00:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 06:00:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 06:00:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 06:00:48,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 06:00:48,531 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 06:00:48,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 06:00:48,769 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 06:00:48,776 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 06:00:48,777 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-16 06:00:48,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:48 BoogieIcfgContainer [2021-12-16 06:00:48,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 06:00:48,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 06:00:48,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 06:00:48,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 06:00:48,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:00:47" (1/3) ... [2021-12-16 06:00:48,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a498a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:48, skipping insertion in model container [2021-12-16 06:00:48,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:48" (2/3) ... [2021-12-16 06:00:48,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a498a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:48, skipping insertion in model container [2021-12-16 06:00:48,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:48" (3/3) ... [2021-12-16 06:00:48,786 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2021-12-16 06:00:48,790 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 06:00:48,790 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-12-16 06:00:48,841 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 06:00:48,848 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-16 06:00:48,848 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-12-16 06:00:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-16 06:00:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:00:48,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:48,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:00:48,875 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-16 06:00:48,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9014308] [2021-12-16 06:00:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:48,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:48,992 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-16 06:00:48,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:48,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9014308] [2021-12-16 06:00:48,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9014308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:48,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:48,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:48,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466568215] [2021-12-16 06:00:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:48,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:48,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:49,022 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 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-16 06:00:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,120 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2021-12-16 06:00:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:49,122 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-16 06:00:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,128 INFO L225 Difference]: With dead ends: 108 [2021-12-16 06:00:49,128 INFO L226 Difference]: Without dead ends: 106 [2021-12-16 06:00:49,129 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-16 06:00:49,132 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-16 06:00:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2021-12-16 06:00:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-16 06:00:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-12-16 06:00:49,162 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 3 [2021-12-16 06:00:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,162 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-12-16 06:00:49,162 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-16 06:00:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-12-16 06:00:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:00:49,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:00:49,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 06:00:49,163 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-16 06:00:49,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288049253] [2021-12-16 06:00:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,193 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-16 06:00:49,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288049253] [2021-12-16 06:00:49,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288049253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:49,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861798362] [2021-12-16 06:00:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:49,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:49,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:49,199 INFO L87 Difference]: Start difference. First operand 96 states and 102 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-16 06:00:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,261 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-12-16 06:00:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:49,262 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-16 06:00:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,265 INFO L225 Difference]: With dead ends: 104 [2021-12-16 06:00:49,266 INFO L226 Difference]: Without dead ends: 104 [2021-12-16 06:00:49,267 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-16 06:00:49,268 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-16 06:00:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2021-12-16 06:00:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 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) [2021-12-16 06:00:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2021-12-16 06:00:49,274 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2021-12-16 06:00:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,274 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2021-12-16 06:00:49,274 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-16 06:00:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2021-12-16 06:00:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 06:00:49,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 06:00:49,275 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2021-12-16 06:00:49,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106623451] [2021-12-16 06:00:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,308 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-16 06:00:49,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106623451] [2021-12-16 06:00:49,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106623451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:49,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258695379] [2021-12-16 06:00:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:49,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:49,311 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-16 06:00:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,398 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2021-12-16 06:00:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:00:49,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-16 06:00:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,403 INFO L225 Difference]: With dead ends: 90 [2021-12-16 06:00:49,403 INFO L226 Difference]: Without dead ends: 90 [2021-12-16 06:00:49,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 06:00:49,409 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 52 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-16 06:00:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2021-12-16 06:00:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-16 06:00:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-16 06:00:49,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 8 [2021-12-16 06:00:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,427 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-16 06:00:49,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-16 06:00:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-16 06:00:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 06:00:49,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 06:00:49,430 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:49,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash 59263653, now seen corresponding path program 1 times [2021-12-16 06:00:49,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830309101] [2021-12-16 06:00:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,495 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-16 06:00:49,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830309101] [2021-12-16 06:00:49,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830309101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:49,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923731631] [2021-12-16 06:00:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:49,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:49,498 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-16 06:00:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,574 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-12-16 06:00:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-16 06:00:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,575 INFO L225 Difference]: With dead ends: 101 [2021-12-16 06:00:49,575 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 06:00:49,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 06:00:49,576 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 97 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 06:00:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2021-12-16 06:00:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-16 06:00:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-12-16 06:00:49,580 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 8 [2021-12-16 06:00:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,580 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-12-16 06:00:49,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-16 06:00:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-12-16 06:00:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:00:49,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 06:00:49,582 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash 460324999, now seen corresponding path program 1 times [2021-12-16 06:00:49,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081452745] [2021-12-16 06:00:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,712 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-16 06:00:49,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081452745] [2021-12-16 06:00:49,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081452745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 06:00:49,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977687022] [2021-12-16 06:00:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:49,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:49,716 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-16 06:00:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,877 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2021-12-16 06:00:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:00:49,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-16 06:00:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,893 INFO L225 Difference]: With dead ends: 170 [2021-12-16 06:00:49,893 INFO L226 Difference]: Without dead ends: 170 [2021-12-16 06:00:49,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:49,894 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 316 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 293 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-16 06:00:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 90. [2021-12-16 06:00:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-16 06:00:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-12-16 06:00:49,898 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2021-12-16 06:00:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,899 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-12-16 06:00:49,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-16 06:00:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-12-16 06:00:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:00:49,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 06:00:49,900 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-16 06:00:49,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097105384] [2021-12-16 06:00:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,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-16 06:00:49,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097105384] [2021-12-16 06:00:49,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097105384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:49,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051326185] [2021-12-16 06:00:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:49,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:49,942 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 06:00:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,066 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-12-16 06:00:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:00:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 06:00:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,067 INFO L225 Difference]: With dead ends: 89 [2021-12-16 06:00:50,067 INFO L226 Difference]: Without dead ends: 89 [2021-12-16 06:00:50,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:00:50,068 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-16 06:00:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-16 06:00:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-16 06:00:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-12-16 06:00:50,072 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2021-12-16 06:00:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,072 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-12-16 06:00:50,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 06:00:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-12-16 06:00:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:00:50,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:50,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 06:00:50,074 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-16 06:00:50,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598313879] [2021-12-16 06:00:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:50,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598313879] [2021-12-16 06:00:50,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598313879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:50,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209576734] [2021-12-16 06:00:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:50,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:50,141 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 06:00:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,297 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-12-16 06:00:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:00:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 06:00:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,298 INFO L225 Difference]: With dead ends: 85 [2021-12-16 06:00:50,298 INFO L226 Difference]: Without dead ends: 85 [2021-12-16 06:00:50,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:50,299 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 22 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-16 06:00:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-12-16 06:00:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-16 06:00:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2021-12-16 06:00:50,302 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 12 [2021-12-16 06:00:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,303 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-12-16 06:00:50,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 06:00:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2021-12-16 06:00:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 06:00:50,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:50,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 06:00:50,303 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177244, now seen corresponding path program 1 times [2021-12-16 06:00:50,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594942454] [2021-12-16 06:00:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,382 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-16 06:00:50,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594942454] [2021-12-16 06:00:50,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594942454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:50,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683127237] [2021-12-16 06:00:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:50,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:50,385 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-16 06:00:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,568 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2021-12-16 06:00:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:50,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-16 06:00:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,570 INFO L225 Difference]: With dead ends: 124 [2021-12-16 06:00:50,570 INFO L226 Difference]: Without dead ends: 124 [2021-12-16 06:00:50,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:00:50,571 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 293 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 200 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-16 06:00:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2021-12-16 06:00:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-16 06:00:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-16 06:00:50,574 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 13 [2021-12-16 06:00:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,575 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-16 06:00:50,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-16 06:00:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-16 06:00:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 06:00:50,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:50,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 06:00:50,576 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177245, now seen corresponding path program 1 times [2021-12-16 06:00:50,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224874718] [2021-12-16 06:00:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,676 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-16 06:00:50,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224874718] [2021-12-16 06:00:50,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224874718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:50,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005616495] [2021-12-16 06:00:50,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:50,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:50,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:50,678 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-16 06:00:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,895 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-12-16 06:00:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:00:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-16 06:00:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,896 INFO L225 Difference]: With dead ends: 158 [2021-12-16 06:00:50,896 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 06:00:50,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:50,897 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 208 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 279 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 06:00:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2021-12-16 06:00:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-16 06:00:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2021-12-16 06:00:50,900 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 13 [2021-12-16 06:00:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,900 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2021-12-16 06:00:50,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-16 06:00:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2021-12-16 06:00:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 06:00:50,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:50,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 06:00:50,901 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -230426379, now seen corresponding path program 1 times [2021-12-16 06:00:50,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987286983] [2021-12-16 06:00:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,997 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-16 06:00:50,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987286983] [2021-12-16 06:00:50,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987286983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 06:00:50,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308348649] [2021-12-16 06:00:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:50,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:00:51,007 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,256 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2021-12-16 06:00:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:00:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 06:00:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,257 INFO L225 Difference]: With dead ends: 143 [2021-12-16 06:00:51,258 INFO L226 Difference]: Without dead ends: 143 [2021-12-16 06:00:51,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-16 06:00:51,258 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 289 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 338 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-16 06:00:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2021-12-16 06:00:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-16 06:00:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-12-16 06:00:51,260 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 16 [2021-12-16 06:00:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,260 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-12-16 06:00:51,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-12-16 06:00:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 06:00:51,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:51,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 06:00:51,261 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash -230426378, now seen corresponding path program 1 times [2021-12-16 06:00:51,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101522186] [2021-12-16 06:00:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,391 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-16 06:00:51,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101522186] [2021-12-16 06:00:51,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101522186] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:51,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078129591] [2021-12-16 06:00:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:51,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:51,394 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,637 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-16 06:00:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:00:51,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 06:00:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,639 INFO L225 Difference]: With dead ends: 153 [2021-12-16 06:00:51,639 INFO L226 Difference]: Without dead ends: 153 [2021-12-16 06:00:51,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:00:51,640 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 215 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 262 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-16 06:00:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2021-12-16 06:00:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-16 06:00:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2021-12-16 06:00:51,642 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 16 [2021-12-16 06:00:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,642 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2021-12-16 06:00:51,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2021-12-16 06:00:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 06:00:51,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:51,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 06:00:51,643 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702036, now seen corresponding path program 1 times [2021-12-16 06:00:51,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167942475] [2021-12-16 06:00:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:51,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167942475] [2021-12-16 06:00:51,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167942475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:51,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423644358] [2021-12-16 06:00:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:51,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:51,729 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:00:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,879 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2021-12-16 06:00:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:51,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-16 06:00:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,880 INFO L225 Difference]: With dead ends: 134 [2021-12-16 06:00:51,880 INFO L226 Difference]: Without dead ends: 134 [2021-12-16 06:00:51,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:00:51,881 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 267 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 208 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-16 06:00:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2021-12-16 06:00:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-16 06:00:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2021-12-16 06:00:51,883 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 17 [2021-12-16 06:00:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,883 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2021-12-16 06:00:51,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:00:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2021-12-16 06:00:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 06:00:51,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:51,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 06:00:51,884 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702037, now seen corresponding path program 1 times [2021-12-16 06:00:51,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545202778] [2021-12-16 06:00:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,003 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-16 06:00:52,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545202778] [2021-12-16 06:00:52,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545202778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:52,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:52,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:52,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714065583] [2021-12-16 06:00:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:52,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:52,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:52,005 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:00:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:52,198 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2021-12-16 06:00:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:00:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-16 06:00:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:52,199 INFO L225 Difference]: With dead ends: 152 [2021-12-16 06:00:52,199 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 06:00:52,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:52,199 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 168 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:52,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 243 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 06:00:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2021-12-16 06:00:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-16 06:00:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2021-12-16 06:00:52,201 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 17 [2021-12-16 06:00:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:52,202 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2021-12-16 06:00:52,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:00:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2021-12-16 06:00:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 06:00:52,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:52,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:52,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 06:00:52,202 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1499460812, now seen corresponding path program 1 times [2021-12-16 06:00:52,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:52,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218928682] [2021-12-16 06:00:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,245 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-16 06:00:52,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218928682] [2021-12-16 06:00:52,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218928682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:52,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:52,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:00:52,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293665268] [2021-12-16 06:00:52,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:52,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:52,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:52,247 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:00:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:52,344 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2021-12-16 06:00:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:00:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-16 06:00:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:52,345 INFO L225 Difference]: With dead ends: 119 [2021-12-16 06:00:52,345 INFO L226 Difference]: Without dead ends: 119 [2021-12-16 06:00:52,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:52,346 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:52,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 307 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-16 06:00:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-16 06:00:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-16 06:00:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2021-12-16 06:00:52,348 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2021-12-16 06:00:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:52,349 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2021-12-16 06:00:52,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:00:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2021-12-16 06:00:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 06:00:52,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:52,349 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-16 06:00:52,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 06:00:52,350 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1296321320, now seen corresponding path program 1 times [2021-12-16 06:00:52,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016059795] [2021-12-16 06:00:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,433 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-16 06:00:52,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016059795] [2021-12-16 06:00:52,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016059795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:52,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:52,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:52,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829930890] [2021-12-16 06:00:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:52,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:52,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:52,435 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-16 06:00:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:52,559 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2021-12-16 06:00:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:00:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-16 06:00:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:52,560 INFO L225 Difference]: With dead ends: 146 [2021-12-16 06:00:52,560 INFO L226 Difference]: Without dead ends: 146 [2021-12-16 06:00:52,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:52,561 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 126 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:52,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 308 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-16 06:00:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2021-12-16 06:00:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 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-16 06:00:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-12-16 06:00:52,563 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 20 [2021-12-16 06:00:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:52,563 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-12-16 06:00:52,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-16 06:00:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-12-16 06:00:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 06:00:52,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:52,564 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-16 06:00:52,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 06:00:52,564 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -852633064, now seen corresponding path program 1 times [2021-12-16 06:00:52,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:52,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361021480] [2021-12-16 06:00:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,581 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-16 06:00:52,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361021480] [2021-12-16 06:00:52,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361021480] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:52,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:52,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:52,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568028407] [2021-12-16 06:00:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:52,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:52,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:52,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:52,584 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 06:00:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:52,589 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2021-12-16 06:00:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:52,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 06:00:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:52,590 INFO L225 Difference]: With dead ends: 119 [2021-12-16 06:00:52,590 INFO L226 Difference]: Without dead ends: 119 [2021-12-16 06:00:52,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-16 06:00:52,590 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:52,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-16 06:00:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-16 06:00:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-16 06:00:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-12-16 06:00:52,593 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 20 [2021-12-16 06:00:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:52,593 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-12-16 06:00:52,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 06:00:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-12-16 06:00:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 06:00:52,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:52,594 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] [2021-12-16 06:00:52,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 06:00:52,594 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash -661774329, now seen corresponding path program 1 times [2021-12-16 06:00:52,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:52,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848246769] [2021-12-16 06:00:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,628 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-16 06:00:52,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848246769] [2021-12-16 06:00:52,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848246769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:52,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:52,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:52,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494746920] [2021-12-16 06:00:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:52,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:52,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:52,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:52,630 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:52,691 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2021-12-16 06:00:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:00:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-16 06:00:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:52,692 INFO L225 Difference]: With dead ends: 118 [2021-12-16 06:00:52,692 INFO L226 Difference]: Without dead ends: 118 [2021-12-16 06:00:52,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:00:52,693 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 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-16 06:00:52,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-16 06:00:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-16 06:00:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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-16 06:00:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2021-12-16 06:00:52,696 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 21 [2021-12-16 06:00:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:52,696 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2021-12-16 06:00:52,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2021-12-16 06:00:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 06:00:52,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:52,697 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] [2021-12-16 06:00:52,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 06:00:52,697 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash -661774328, now seen corresponding path program 1 times [2021-12-16 06:00:52,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842196349] [2021-12-16 06:00:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,809 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-16 06:00:52,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842196349] [2021-12-16 06:00:52,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842196349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:52,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:52,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 06:00:52,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450896214] [2021-12-16 06:00:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:52,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 06:00:52,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 06:00:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:00:52,810 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,060 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2021-12-16 06:00:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 06:00:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-16 06:00:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,061 INFO L225 Difference]: With dead ends: 138 [2021-12-16 06:00:53,061 INFO L226 Difference]: Without dead ends: 138 [2021-12-16 06:00:53,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-12-16 06:00:53,061 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 210 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 368 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-16 06:00:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2021-12-16 06:00:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-16 06:00:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2021-12-16 06:00:53,064 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2021-12-16 06:00:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,064 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2021-12-16 06:00:53,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2021-12-16 06:00:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 06:00:53,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,064 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] [2021-12-16 06:00:53,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 06:00:53,064 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2015766217, now seen corresponding path program 1 times [2021-12-16 06:00:53,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219269551] [2021-12-16 06:00:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,102 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-16 06:00:53,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219269551] [2021-12-16 06:00:53,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219269551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:53,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:53,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605190441] [2021-12-16 06:00:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:53,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:53,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:53,104 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,113 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2021-12-16 06:00:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:53,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-16 06:00:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,115 INFO L225 Difference]: With dead ends: 185 [2021-12-16 06:00:53,115 INFO L226 Difference]: Without dead ends: 185 [2021-12-16 06:00:53,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-16 06:00:53,116 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-16 06:00:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2021-12-16 06:00:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 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-16 06:00:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2021-12-16 06:00:53,119 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2021-12-16 06:00:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,120 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2021-12-16 06:00:53,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2021-12-16 06:00:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 06:00:53,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,120 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] [2021-12-16 06:00:53,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 06:00:53,121 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash -224265605, now seen corresponding path program 1 times [2021-12-16 06:00:53,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243711658] [2021-12-16 06:00:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,254 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-16 06:00:53,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243711658] [2021-12-16 06:00:53,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243711658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:53,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 06:00:53,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095131868] [2021-12-16 06:00:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:53,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:53,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:00:53,256 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-16 06:00:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,428 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2021-12-16 06:00:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:53,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-16 06:00:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,429 INFO L225 Difference]: With dead ends: 149 [2021-12-16 06:00:53,429 INFO L226 Difference]: Without dead ends: 149 [2021-12-16 06:00:53,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-16 06:00:53,430 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 256 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 317 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-16 06:00:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2021-12-16 06:00:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 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-16 06:00:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2021-12-16 06:00:53,432 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 22 [2021-12-16 06:00:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,432 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2021-12-16 06:00:53,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-16 06:00:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2021-12-16 06:00:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:00:53,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,433 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] [2021-12-16 06:00:53,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 06:00:53,433 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash -350969464, now seen corresponding path program 1 times [2021-12-16 06:00:53,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501385927] [2021-12-16 06:00:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:53,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501385927] [2021-12-16 06:00:53,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501385927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:53,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:53,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273809402] [2021-12-16 06:00:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:53,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:53,473 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-16 06:00:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,570 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2021-12-16 06:00:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:53,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-12-16 06:00:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,571 INFO L225 Difference]: With dead ends: 134 [2021-12-16 06:00:53,571 INFO L226 Difference]: Without dead ends: 134 [2021-12-16 06:00:53,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:00:53,572 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 154 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-16 06:00:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2021-12-16 06:00:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 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-16 06:00:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2021-12-16 06:00:53,576 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 23 [2021-12-16 06:00:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,577 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2021-12-16 06:00:53,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-16 06:00:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2021-12-16 06:00:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:00:53,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,577 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] [2021-12-16 06:00:53,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 06:00:53,577 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash -350969463, now seen corresponding path program 1 times [2021-12-16 06:00:53,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254830656] [2021-12-16 06:00:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,707 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-16 06:00:53,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254830656] [2021-12-16 06:00:53,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254830656] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:53,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663038040] [2021-12-16 06:00:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:53,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:53,710 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-16 06:00:53,715 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-16 06:00:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 06:00:53,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:53,946 INFO L388 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 23 treesize of output 15 [2021-12-16 06:00:53,951 INFO L388 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 28 treesize of output 16 [2021-12-16 06:00:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:53,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:53,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663038040] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:00:53,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2021-12-16 06:00:53,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566898579] [2021-12-16 06:00:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:53,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-12-16 06:00:53,979 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-16 06:00:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:54,136 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2021-12-16 06:00:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-12-16 06:00:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:54,138 INFO L225 Difference]: With dead ends: 132 [2021-12-16 06:00:54,138 INFO L226 Difference]: Without dead ends: 132 [2021-12-16 06:00:54,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-16 06:00:54,139 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:54,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-16 06:00:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2021-12-16 06:00:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 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-16 06:00:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2021-12-16 06:00:54,141 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 23 [2021-12-16 06:00:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:54,141 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2021-12-16 06:00:54,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-16 06:00:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2021-12-16 06:00:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:00:54,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:54,141 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] [2021-12-16 06:00:54,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:54,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-16 06:00:54,342 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1019044192, now seen corresponding path program 1 times [2021-12-16 06:00:54,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:54,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996196385] [2021-12-16 06:00:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:54,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:54,483 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-16 06:00:54,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:54,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996196385] [2021-12-16 06:00:54,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996196385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:54,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:54,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 06:00:54,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163638141] [2021-12-16 06:00:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:54,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:00:54,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:00:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:00:54,485 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-16 06:00:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:54,751 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2021-12-16 06:00:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 06:00:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-12-16 06:00:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:54,752 INFO L225 Difference]: With dead ends: 144 [2021-12-16 06:00:54,752 INFO L226 Difference]: Without dead ends: 144 [2021-12-16 06:00:54,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-12-16 06:00:54,753 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 137 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:54,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 410 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-16 06:00:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2021-12-16 06:00:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 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-16 06:00:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2021-12-16 06:00:54,755 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 24 [2021-12-16 06:00:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:54,755 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2021-12-16 06:00:54,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-16 06:00:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2021-12-16 06:00:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:00:54,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:54,756 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:54,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 06:00:54,756 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1710834765, now seen corresponding path program 1 times [2021-12-16 06:00:54,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:54,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17984219] [2021-12-16 06:00:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:54,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:54,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:54,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17984219] [2021-12-16 06:00:54,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17984219] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:54,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548805559] [2021-12-16 06:00:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:54,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:54,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:00:54,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 06:00:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:54,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-16 06:00:54,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:54,940 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:54,993 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:00:54,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:00:55,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-16 06:00:55,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:55,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-16 06:00:55,135 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:55,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-16 06:00:55,200 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:55,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-16 06:00:55,220 INFO L388 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 24 treesize of output 12 [2021-12-16 06:00:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:55,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:00:55,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-16 06:00:55,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-16 06:00:55,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_551) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-16 06:00:55,295 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:00:55,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2021-12-16 06:00:55,302 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:00:55,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-16 06:00:55,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-16 06:00:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-16 06:00:55,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548805559] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:00:55,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:00:55,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2021-12-16 06:00:55,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208543703] [2021-12-16 06:00:55,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:00:55,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-16 06:00:55,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-16 06:00:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=319, Unknown=3, NotChecked=114, Total=506 [2021-12-16 06:00:55,419 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-16 06:00:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:55,874 INFO L93 Difference]: Finished difference Result 244 states and 265 transitions. [2021-12-16 06:00:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 06:00:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 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 24 [2021-12-16 06:00:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:55,875 INFO L225 Difference]: With dead ends: 244 [2021-12-16 06:00:55,875 INFO L226 Difference]: Without dead ends: 244 [2021-12-16 06:00:55,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=603, Unknown=6, NotChecked=162, Total=930 [2021-12-16 06:00:55,877 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 336 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 636 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:55,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 678 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 636 Unchecked, 0.3s Time] [2021-12-16 06:00:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-16 06:00:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2021-12-16 06:00:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-16 06:00:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2021-12-16 06:00:55,884 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 24 [2021-12-16 06:00:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:55,884 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2021-12-16 06:00:55,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-16 06:00:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2021-12-16 06:00:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:00:55,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:55,885 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:55,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:56,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-16 06:00:56,102 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2020763981, now seen corresponding path program 1 times [2021-12-16 06:00:56,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:56,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613045392] [2021-12-16 06:00:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:56,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:56,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613045392] [2021-12-16 06:00:56,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613045392] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589356254] [2021-12-16 06:00:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:56,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:56,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:56,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:00:56,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 06:00:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:56,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 06:00:56,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:56,407 INFO L388 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 25 treesize of output 17 [2021-12-16 06:00:56,410 INFO L388 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 21 treesize of output 13 [2021-12-16 06:00:56,437 INFO L388 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 19 treesize of output 7 [2021-12-16 06:00:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:56,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:56,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589356254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:56,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:00:56,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2021-12-16 06:00:56,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329946152] [2021-12-16 06:00:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:56,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:56,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:56,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-16 06:00:56,454 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-16 06:00:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:56,648 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2021-12-16 06:00:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-16 06:00:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:56,650 INFO L225 Difference]: With dead ends: 170 [2021-12-16 06:00:56,650 INFO L226 Difference]: Without dead ends: 170 [2021-12-16 06:00:56,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-12-16 06:00:56,651 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:56,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-16 06:00:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2021-12-16 06:00:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-16 06:00:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2021-12-16 06:00:56,653 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 25 [2021-12-16 06:00:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:56,654 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2021-12-16 06:00:56,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-16 06:00:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2021-12-16 06:00:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:00:56,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:56,654 INFO L514 BasicCegarLoop]: trace histogram [2, 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-16 06:00:56,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 06:00:56,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:56,863 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:00:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1496266000, now seen corresponding path program 1 times [2021-12-16 06:00:56,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:56,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210905318] [2021-12-16 06:00:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:56,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:56,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210905318] [2021-12-16 06:00:56,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210905318] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703692722] [2021-12-16 06:00:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:56,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:56,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:00:56,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 06:00:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:57,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 06:00:57,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:57,061 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:57,115 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 06:00:57,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-16 06:00:57,152 INFO L388 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-16 06:00:57,249 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:57,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-16 06:00:57,290 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:57,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-16 06:00:57,351 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:57,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-16 06:00:57,381 INFO L388 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 25 treesize of output 13 [2021-12-16 06:00:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:57,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:00:57,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-16 06:00:57,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-16 06:00:57,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-16 06:00:57,513 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:00:57,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 21 [2021-12-16 06:00:57,519 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:00:57,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-16 06:00:57,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-16 06:00:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-16 06:00:59,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703692722] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:00:59,805 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:00:59,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-16 06:00:59,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374975669] [2021-12-16 06:00:59,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:00:59,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 06:00:59,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 06:00:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=407, Unknown=3, NotChecked=132, Total=650 [2021-12-16 06:00:59,806 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-16 06:01:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:00,334 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2021-12-16 06:01:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 06:01:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 06:01:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:00,335 INFO L225 Difference]: With dead ends: 245 [2021-12-16 06:01:00,335 INFO L226 Difference]: Without dead ends: 245 [2021-12-16 06:01:00,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=272, Invalid=859, Unknown=3, NotChecked=198, Total=1332 [2021-12-16 06:01:00,336 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 398 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 696 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:00,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 541 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 646 Invalid, 0 Unknown, 696 Unchecked, 0.3s Time] [2021-12-16 06:01:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-16 06:01:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 167. [2021-12-16 06:01:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-16 06:01:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2021-12-16 06:01:00,338 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 25 [2021-12-16 06:01:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:00,339 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2021-12-16 06:01:00,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-16 06:01:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2021-12-16 06:01:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:01:00,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:00,339 INFO L514 BasicCegarLoop]: trace histogram [2, 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-16 06:01:00,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:00,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-16 06:01:00,540 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1496265999, now seen corresponding path program 1 times [2021-12-16 06:01:00,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:01:00,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491874953] [2021-12-16 06:01:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:00,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:01:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:00,569 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2021-12-16 06:01:00,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 06:01:00,575 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-16 06:01:00,578 INFO L158 Benchmark]: Toolchain (without parser) took 12652.17ms. Allocated memory was 86.0MB in the beginning and 218.1MB in the end (delta: 132.1MB). Free memory was 52.9MB in the beginning and 100.8MB in the end (delta: -47.9MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2021-12-16 06:01:00,578 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 86.0MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 06:01:00,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.38ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 52.7MB in the beginning and 85.4MB in the end (delta: -32.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2021-12-16 06:01:00,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.42ms. Allocated memory is still 115.3MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:01:00,579 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 115.3MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:01:00,579 INFO L158 Benchmark]: RCFGBuilder took 446.51ms. Allocated memory is still 115.3MB. Free memory was 81.7MB in the beginning and 65.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 06:01:00,579 INFO L158 Benchmark]: TraceAbstraction took 11796.57ms. Allocated memory was 115.3MB in the beginning and 218.1MB in the end (delta: 102.8MB). Free memory was 64.9MB in the beginning and 100.8MB in the end (delta: -35.9MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2021-12-16 06:01:00,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 86.0MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.38ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 52.7MB in the beginning and 85.4MB in the end (delta: -32.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.42ms. Allocated memory is still 115.3MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 115.3MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.51ms. Allocated memory is still 115.3MB. Free memory was 81.7MB in the beginning and 65.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11796.57ms. Allocated memory was 115.3MB in the beginning and 218.1MB in the end (delta: 102.8MB). Free memory was 64.9MB in the beginning and 100.8MB in the end (delta: -35.9MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-16 06:01:00,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/sll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 06:01:02,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 06:01:02,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 06:01:02,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 06:01:02,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 06:01:02,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 06:01:02,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 06:01:02,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 06:01:02,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 06:01:02,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 06:01:02,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 06:01:02,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 06:01:02,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 06:01:02,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 06:01:02,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 06:01:02,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 06:01:02,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 06:01:02,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 06:01:02,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 06:01:02,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 06:01:02,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 06:01:02,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 06:01:02,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 06:01:02,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 06:01:02,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 06:01:02,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 06:01:02,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 06:01:02,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 06:01:02,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 06:01:02,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 06:01:02,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 06:01:02,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 06:01:02,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 06:01:02,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 06:01:02,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 06:01:02,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 06:01:02,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 06:01:02,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 06:01:02,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 06:01:02,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 06:01:02,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 06:01:02,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 06:01:02,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 06:01:02,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 06:01:02,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 06:01:02,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 06:01:02,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 06:01:02,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 06:01:02,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 06:01:02,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 06:01:02,526 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 06:01:02,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 06:01:02,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 06:01:02,527 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 06:01:02,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 06:01:02,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 06:01:02,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 06:01:02,528 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 06:01:02,528 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 06:01:02,528 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 06:01:02,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 06:01:02,528 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 06:01:02,529 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 06:01:02,529 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 06:01:02,529 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 06:01:02,529 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 06:01:02,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 06:01:02,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 06:01:02,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 06:01:02,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:01:02,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 06:01:02,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 06:01:02,530 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 06:01:02,530 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 06:01:02,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 06:01:02,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 06:01:02,531 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2021-12-16 06:01:02,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 06:01:02,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 06:01:02,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 06:01:02,853 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 06:01:02,853 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 06:01:02,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2021-12-16 06:01:02,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5caa9839e/e14c19cc0ff2427a8495cb9dce813d95/FLAGf4ffcf85a [2021-12-16 06:01:03,269 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 06:01:03,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2021-12-16 06:01:03,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5caa9839e/e14c19cc0ff2427a8495cb9dce813d95/FLAGf4ffcf85a [2021-12-16 06:01:03,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5caa9839e/e14c19cc0ff2427a8495cb9dce813d95 [2021-12-16 06:01:03,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 06:01:03,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 06:01:03,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 06:01:03,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 06:01:03,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 06:01:03,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:01:03" (1/1) ... [2021-12-16 06:01:03,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bd6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:03, skipping insertion in model container [2021-12-16 06:01:03,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:01:03" (1/1) ... [2021-12-16 06:01:03,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 06:01:03,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 06:01:04,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2021-12-16 06:01:04,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2021-12-16 06:01:04,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2021-12-16 06:01:04,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:01:04,036 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 06:01:04,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2021-12-16 06:01:04,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2021-12-16 06:01:04,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2021-12-16 06:01:04,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:01:04,120 INFO L208 MainTranslator]: Completed translation [2021-12-16 06:01:04,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04 WrapperNode [2021-12-16 06:01:04,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 06:01:04,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 06:01:04,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 06:01:04,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 06:01:04,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,179 INFO L137 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2021-12-16 06:01:04,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 06:01:04,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 06:01:04,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 06:01:04,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 06:01:04,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 06:01:04,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 06:01:04,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 06:01:04,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 06:01:04,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (1/1) ... [2021-12-16 06:01:04,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:01:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:01:04,277 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-16 06:01:04,312 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-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 06:01:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 06:01:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 06:01:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 06:01:04,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 06:01:04,449 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 06:01:04,464 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 06:01:04,863 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 06:01:04,871 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 06:01:04,871 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-16 06:01:04,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:01:04 BoogieIcfgContainer [2021-12-16 06:01:04,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 06:01:04,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 06:01:04,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 06:01:04,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 06:01:04,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:01:03" (1/3) ... [2021-12-16 06:01:04,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3fa87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:01:04, skipping insertion in model container [2021-12-16 06:01:04,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:01:04" (2/3) ... [2021-12-16 06:01:04,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3fa87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:01:04, skipping insertion in model container [2021-12-16 06:01:04,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:01:04" (3/3) ... [2021-12-16 06:01:04,879 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2021-12-16 06:01:04,883 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 06:01:04,883 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-12-16 06:01:04,931 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 06:01:04,939 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-16 06:01:04,939 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-12-16 06:01:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 53 states have (on average 2.2264150943396226) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-16 06:01:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:01:04,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:04,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:01:04,970 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-16 06:01:04,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:04,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962386528] [2021-12-16 06:01:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:04,983 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:04,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:04,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 06:01:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:05,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 06:01:05,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:05,159 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:05,167 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-16 06:01:05,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:05,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962386528] [2021-12-16 06:01:05,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962386528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:05,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:05,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:01:05,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943069004] [2021-12-16 06:01:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:05,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:01:05,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:01:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:01:05,199 INFO L87 Difference]: Start difference. First operand has 100 states, 53 states have (on average 2.2264150943396226) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 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-16 06:01:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:05,359 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-12-16 06:01:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:01:05,361 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-16 06:01:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:05,366 INFO L225 Difference]: With dead ends: 106 [2021-12-16 06:01:05,366 INFO L226 Difference]: Without dead ends: 104 [2021-12-16 06:01:05,367 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-16 06:01:05,370 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:05,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:01:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-16 06:01:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2021-12-16 06:01:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-16 06:01:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2021-12-16 06:01:05,396 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 3 [2021-12-16 06:01:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:05,397 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2021-12-16 06:01:05,397 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-16 06:01:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2021-12-16 06:01:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:01:05,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:05,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:01:05,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:05,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:05,607 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-16 06:01:05,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:05,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301756828] [2021-12-16 06:01:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:05,608 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:05,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:05,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 06:01:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:05,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:01:05,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:05,677 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:05,690 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-16 06:01:05,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:05,690 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:05,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301756828] [2021-12-16 06:01:05,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301756828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:05,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:05,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:01:05,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132148169] [2021-12-16 06:01:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:05,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:01:05,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:01:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:01:05,697 INFO L87 Difference]: Start difference. First operand 94 states and 100 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-16 06:01:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:05,831 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-12-16 06:01:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:01:05,832 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-16 06:01:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:05,833 INFO L225 Difference]: With dead ends: 102 [2021-12-16 06:01:05,834 INFO L226 Difference]: Without dead ends: 102 [2021-12-16 06:01:05,834 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-16 06:01:05,835 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:05,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 75 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:01:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-16 06:01:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2021-12-16 06:01:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-16 06:01:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2021-12-16 06:01:05,840 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 3 [2021-12-16 06:01:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:05,841 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2021-12-16 06:01:05,841 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-16 06:01:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2021-12-16 06:01:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 06:01:05,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:05,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:05,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:06,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:06,048 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027163, now seen corresponding path program 1 times [2021-12-16 06:01:06,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:06,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490465300] [2021-12-16 06:01:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:06,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:06,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:06,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:06,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 06:01:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:06,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:01:06,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:06,152 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:06,177 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-16 06:01:06,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:06,177 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:06,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490465300] [2021-12-16 06:01:06,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490465300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:06,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:06,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:01:06,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679021284] [2021-12-16 06:01:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:06,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:01:06,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:01:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:01:06,185 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:06,400 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2021-12-16 06:01:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:01:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 06:01:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:06,401 INFO L225 Difference]: With dead ends: 88 [2021-12-16 06:01:06,401 INFO L226 Difference]: Without dead ends: 88 [2021-12-16 06:01:06,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-16 06:01:06,402 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 134 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:06,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 50 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-16 06:01:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2021-12-16 06:01:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-16 06:01:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2021-12-16 06:01:06,407 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 7 [2021-12-16 06:01:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:06,407 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2021-12-16 06:01:06,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2021-12-16 06:01:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 06:01:06,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:06,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:06,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:06,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:06,615 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027164, now seen corresponding path program 1 times [2021-12-16 06:01:06,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233892144] [2021-12-16 06:01:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:06,616 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:06,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:06,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:06,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 06:01:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:06,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:01:06,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:06,684 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:06,731 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-16 06:01:06,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:06,732 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:06,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233892144] [2021-12-16 06:01:06,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233892144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:06,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:06,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:01:06,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378565418] [2021-12-16 06:01:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:06,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:01:06,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:01:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:01:06,734 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:06,957 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2021-12-16 06:01:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:01:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 06:01:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:06,959 INFO L225 Difference]: With dead ends: 98 [2021-12-16 06:01:06,959 INFO L226 Difference]: Without dead ends: 98 [2021-12-16 06:01:06,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-16 06:01:06,960 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:06,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 93 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-16 06:01:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2021-12-16 06:01:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-16 06:01:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-16 06:01:06,964 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 7 [2021-12-16 06:01:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:06,965 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-16 06:01:06,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-16 06:01:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 06:01:06,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:06,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:06,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:07,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:07,172 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash 399103166, now seen corresponding path program 1 times [2021-12-16 06:01:07,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:07,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72043869] [2021-12-16 06:01:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:07,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:07,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:07,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 06:01:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:07,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 06:01:07,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:07,266 INFO L388 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-16 06:01:07,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:07,293 INFO L388 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 21 treesize of output 20 [2021-12-16 06:01:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:07,364 INFO L388 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 21 treesize of output 20 [2021-12-16 06:01:07,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-16 06:01:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:07,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:07,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:07,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72043869] [2021-12-16 06:01:07,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72043869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:07,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:07,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:01:07,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886021545] [2021-12-16 06:01:07,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:07,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:01:07,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:01:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:07,413 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-16 06:01:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:07,804 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2021-12-16 06:01:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:01:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-16 06:01:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:07,806 INFO L225 Difference]: With dead ends: 167 [2021-12-16 06:01:07,806 INFO L226 Difference]: Without dead ends: 167 [2021-12-16 06:01:07,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:01:07,806 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 228 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:07,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 287 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:01:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-16 06:01:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 87. [2021-12-16 06:01:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-16 06:01:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-12-16 06:01:07,811 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 11 [2021-12-16 06:01:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:07,812 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-12-16 06:01:07,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-16 06:01:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-12-16 06:01:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 06:01:07,812 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:07,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:07,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:08,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:08,019 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-16 06:01:08,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:08,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244992507] [2021-12-16 06:01:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:08,020 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:08,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:08,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:08,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 06:01:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:08,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 06:01:08,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:08,090 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:08,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:08,129 INFO L388 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 20 treesize of output 12 [2021-12-16 06:01:08,144 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-16 06:01:08,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:08,144 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:08,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244992507] [2021-12-16 06:01:08,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244992507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:08,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:08,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:01:08,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565403862] [2021-12-16 06:01:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:08,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:01:08,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:08,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:01:08,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:01:08,146 INFO L87 Difference]: Start difference. First operand 87 states and 94 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-16 06:01:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:08,406 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-12-16 06:01:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:01:08,407 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-16 06:01:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:08,407 INFO L225 Difference]: With dead ends: 86 [2021-12-16 06:01:08,407 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 06:01:08,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:01:08,408 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:08,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 06:01:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-16 06:01:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2021-12-16 06:01:08,411 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 11 [2021-12-16 06:01:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:08,412 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2021-12-16 06:01:08,412 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-16 06:01:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2021-12-16 06:01:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 06:01:08,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:08,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:08,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-16 06:01:08,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:08,619 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:08,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-16 06:01:08,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:08,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090823832] [2021-12-16 06:01:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:08,620 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:08,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:08,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 06:01:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:08,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 06:01:08,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:08,692 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:08,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:08,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:08,741 INFO L388 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 17 treesize of output 9 [2021-12-16 06:01:08,744 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:08,785 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-16 06:01:08,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:08,785 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090823832] [2021-12-16 06:01:08,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090823832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:08,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:08,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:01:08,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186345043] [2021-12-16 06:01:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:08,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:01:08,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:08,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:01:08,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:01:08,787 INFO L87 Difference]: Start difference. First operand 86 states and 93 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-16 06:01:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:09,119 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2021-12-16 06:01:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:01:09,120 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-16 06:01:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:09,120 INFO L225 Difference]: With dead ends: 82 [2021-12-16 06:01:09,120 INFO L226 Difference]: Without dead ends: 82 [2021-12-16 06:01:09,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:01:09,121 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 20 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:09,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 225 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-16 06:01:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2021-12-16 06:01:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-16 06:01:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-16 06:01:09,123 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2021-12-16 06:01:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:09,124 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-16 06:01:09,124 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-16 06:01:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-16 06:01:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:01:09,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:09,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:09,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:09,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:09,331 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash -512699581, now seen corresponding path program 1 times [2021-12-16 06:01:09,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574800441] [2021-12-16 06:01:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:09,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:09,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:09,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:09,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 06:01:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:09,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 06:01:09,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:09,402 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:09,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:09,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:09,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:09,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:09,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:09,529 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:09,546 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-16 06:01:09,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:09,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:09,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574800441] [2021-12-16 06:01:09,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574800441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:09,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:09,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:01:09,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566299524] [2021-12-16 06:01:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:09,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:01:09,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:01:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:09,548 INFO L87 Difference]: Start difference. First operand 78 states and 85 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-16 06:01:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:09,804 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2021-12-16 06:01:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:01:09,805 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-16 06:01:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:09,805 INFO L225 Difference]: With dead ends: 128 [2021-12-16 06:01:09,805 INFO L226 Difference]: Without dead ends: 128 [2021-12-16 06:01:09,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:01:09,806 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 193 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:09,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 143 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-16 06:01:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2021-12-16 06:01:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-16 06:01:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2021-12-16 06:01:09,809 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 12 [2021-12-16 06:01:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:09,809 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2021-12-16 06:01:09,809 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-16 06:01:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2021-12-16 06:01:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 06:01:09,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:09,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:09,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:10,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:10,016 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash -512699580, now seen corresponding path program 1 times [2021-12-16 06:01:10,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:10,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615635779] [2021-12-16 06:01:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:10,017 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:10,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:10,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:10,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-16 06:01:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:10,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 06:01:10,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:10,089 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:10,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:10,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:10,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:10,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:10,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:10,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:10,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:10,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:10,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:10,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:10,241 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:10,244 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:10,272 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-16 06:01:10,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:10,272 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:10,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615635779] [2021-12-16 06:01:10,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615635779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:10,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:10,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:01:10,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709535143] [2021-12-16 06:01:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:10,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:01:10,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:01:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:10,274 INFO L87 Difference]: Start difference. First operand 80 states and 88 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-16 06:01:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:10,641 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2021-12-16 06:01:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:01:10,641 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-16 06:01:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:10,642 INFO L225 Difference]: With dead ends: 155 [2021-12-16 06:01:10,642 INFO L226 Difference]: Without dead ends: 155 [2021-12-16 06:01:10,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:01:10,642 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 162 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:10,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 226 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:01:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-16 06:01:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 92. [2021-12-16 06:01:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-16 06:01:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2021-12-16 06:01:10,647 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 12 [2021-12-16 06:01:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:10,647 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2021-12-16 06:01:10,647 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-16 06:01:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2021-12-16 06:01:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:01:10,647 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:10,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:10,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:10,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:10,854 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:10,855 INFO L85 PathProgramCache]: Analyzing trace with hash -929437396, now seen corresponding path program 1 times [2021-12-16 06:01:10,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:10,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157150185] [2021-12-16 06:01:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:10,855 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:10,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:10,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:10,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-16 06:01:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:10,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 06:01:10,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:10,937 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:10,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:10,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:10,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:10,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:10,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:11,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:11,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,095 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:11,190 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 06:01:11,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2021-12-16 06:01:11,198 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-16 06:01:11,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:11,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:11,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157150185] [2021-12-16 06:01:11,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157150185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:11,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:11,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:01:11,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130333712] [2021-12-16 06:01:11,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:11,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:01:11,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:11,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:01:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:01:11,200 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:11,362 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2021-12-16 06:01:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:01:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-16 06:01:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:11,364 INFO L225 Difference]: With dead ends: 95 [2021-12-16 06:01:11,364 INFO L226 Difference]: Without dead ends: 95 [2021-12-16 06:01:11,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:01:11,364 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:11,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 215 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2021-12-16 06:01:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-16 06:01:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2021-12-16 06:01:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-16 06:01:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-16 06:01:11,367 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 15 [2021-12-16 06:01:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:11,367 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-16 06:01:11,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-16 06:01:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:01:11,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:11,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:11,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:11,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:11,575 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash -929437395, now seen corresponding path program 1 times [2021-12-16 06:01:11,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:11,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605344695] [2021-12-16 06:01:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:11,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:11,577 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:11,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 06:01:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:11,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 06:01:11,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:11,655 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:11,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:11,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:11,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:11,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:11,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:11,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:11,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:11,915 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 06:01:11,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2021-12-16 06:01:11,921 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 06:01:11,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2021-12-16 06:01:11,935 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-16 06:01:11,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:11,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:11,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605344695] [2021-12-16 06:01:11,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605344695] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:11,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:11,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:01:11,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181650735] [2021-12-16 06:01:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:11,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:01:11,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:01:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:01:11,937 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:12,155 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2021-12-16 06:01:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:01:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-16 06:01:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:12,156 INFO L225 Difference]: With dead ends: 96 [2021-12-16 06:01:12,156 INFO L226 Difference]: Without dead ends: 96 [2021-12-16 06:01:12,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:01:12,157 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:12,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 245 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2021-12-16 06:01:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-16 06:01:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2021-12-16 06:01:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-16 06:01:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2021-12-16 06:01:12,159 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 15 [2021-12-16 06:01:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:12,159 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2021-12-16 06:01:12,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2021-12-16 06:01:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:01:12,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:12,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:12,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-16 06:01:12,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:12,367 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -448678999, now seen corresponding path program 1 times [2021-12-16 06:01:12,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094924990] [2021-12-16 06:01:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:12,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:12,368 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:12,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 06:01:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 06:01:12,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:12,449 INFO L388 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-16 06:01:12,461 INFO L388 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 16 treesize of output 8 [2021-12-16 06:01:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:12,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:12,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094924990] [2021-12-16 06:01:12,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094924990] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:12,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:12,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:01:12,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113220914] [2021-12-16 06:01:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:12,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:01:12,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:01:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:01:12,482 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:12,669 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2021-12-16 06:01:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:01:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-16 06:01:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:12,670 INFO L225 Difference]: With dead ends: 94 [2021-12-16 06:01:12,671 INFO L226 Difference]: Without dead ends: 94 [2021-12-16 06:01:12,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:01:12,671 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:12,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 294 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:01:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-16 06:01:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2021-12-16 06:01:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-16 06:01:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-12-16 06:01:12,673 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 15 [2021-12-16 06:01:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:12,674 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-12-16 06:01:12,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-12-16 06:01:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 06:01:12,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:12,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:12,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:12,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:12,881 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196987, now seen corresponding path program 1 times [2021-12-16 06:01:12,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:12,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125180119] [2021-12-16 06:01:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:12,882 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:12,883 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 06:01:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:12,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:01:12,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:12,991 INFO L388 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 19 treesize of output 11 [2021-12-16 06:01:13,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-16 06:01:13,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:13,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:13,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125180119] [2021-12-16 06:01:13,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125180119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:13,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:13,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:01:13,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389399719] [2021-12-16 06:01:13,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:13,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:01:13,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:13,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:01:13,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:13,007 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:13,369 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2021-12-16 06:01:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:01:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 06:01:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:13,370 INFO L225 Difference]: With dead ends: 127 [2021-12-16 06:01:13,370 INFO L226 Difference]: Without dead ends: 127 [2021-12-16 06:01:13,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:01:13,371 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 172 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:13,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 162 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:01:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-16 06:01:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2021-12-16 06:01:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-16 06:01:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2021-12-16 06:01:13,373 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 16 [2021-12-16 06:01:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:13,373 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2021-12-16 06:01:13,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2021-12-16 06:01:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 06:01:13,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:13,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:13,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:13,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:13,590 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196988, now seen corresponding path program 1 times [2021-12-16 06:01:13,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278559166] [2021-12-16 06:01:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:13,591 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:13,592 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:13,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 06:01:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:13,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 06:01:13,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:13,762 INFO L388 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 23 treesize of output 15 [2021-12-16 06:01:13,764 INFO L388 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 34 treesize of output 18 [2021-12-16 06:01:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:13,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:13,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:13,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278559166] [2021-12-16 06:01:13,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278559166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:13,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:13,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:01:13,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142692114] [2021-12-16 06:01:13,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:13,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:01:13,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:01:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:13,837 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:14,766 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2021-12-16 06:01:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:01:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-16 06:01:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:14,768 INFO L225 Difference]: With dead ends: 126 [2021-12-16 06:01:14,768 INFO L226 Difference]: Without dead ends: 126 [2021-12-16 06:01:14,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:01:14,769 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:14,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 177 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 06:01:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-16 06:01:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2021-12-16 06:01:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-16 06:01:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-12-16 06:01:14,770 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 16 [2021-12-16 06:01:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:14,771 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-12-16 06:01:14,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-12-16 06:01:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 06:01:14,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:14,771 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-16 06:01:14,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:14,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:14,978 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 770466058, now seen corresponding path program 1 times [2021-12-16 06:01:14,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:14,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525933036] [2021-12-16 06:01:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:14,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:14,979 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:14,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 06:01:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:15,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 06:01:15,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:15,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:15,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:15,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:15,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:15,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:15,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:15,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:01:15,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:15,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:15,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:15,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:15,216 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:15,218 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:15,255 INFO L388 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 15 treesize of output 7 [2021-12-16 06:01:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:15,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:15,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525933036] [2021-12-16 06:01:15,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525933036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:15,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:15,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 06:01:15,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152356352] [2021-12-16 06:01:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:15,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:01:15,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:01:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:01:15,279 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-16 06:01:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:15,664 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2021-12-16 06:01:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:01:15,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-16 06:01:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:15,665 INFO L225 Difference]: With dead ends: 132 [2021-12-16 06:01:15,665 INFO L226 Difference]: Without dead ends: 132 [2021-12-16 06:01:15,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:01:15,666 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 229 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:15,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 341 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:01:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-16 06:01:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2021-12-16 06:01:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-16 06:01:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-12-16 06:01:15,668 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2021-12-16 06:01:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:15,668 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-12-16 06:01:15,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-16 06:01:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-12-16 06:01:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 06:01:15,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:15,668 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-16 06:01:15,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:15,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:15,869 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1441667505, now seen corresponding path program 1 times [2021-12-16 06:01:15,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:15,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958464528] [2021-12-16 06:01:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:15,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:15,871 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:15,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 06:01:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:15,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 06:01:15,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:15,972 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-16 06:01:15,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:15,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:15,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958464528] [2021-12-16 06:01:15,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958464528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:15,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:15,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:01:15,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948751778] [2021-12-16 06:01:15,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:15,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:01:15,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:15,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:01:15,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:01:15,975 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-16 06:01:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:15,988 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-12-16 06:01:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:01:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-16 06:01:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:15,989 INFO L225 Difference]: With dead ends: 92 [2021-12-16 06:01:15,989 INFO L226 Difference]: Without dead ends: 92 [2021-12-16 06:01:15,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-16 06:01:15,990 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:15,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:01:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-16 06:01:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-16 06:01:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-16 06:01:15,993 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 19 [2021-12-16 06:01:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:15,993 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-16 06:01:15,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-16 06:01:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-16 06:01:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 06:01:15,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:15,995 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-16 06:01:16,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:16,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:16,202 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -740864340, now seen corresponding path program 1 times [2021-12-16 06:01:16,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266770403] [2021-12-16 06:01:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:16,203 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:16,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:16,204 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:16,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 06:01:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:16,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 06:01:16,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:16,298 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-16 06:01:16,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:16,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:16,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266770403] [2021-12-16 06:01:16,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266770403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:16,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:16,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:01:16,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957073814] [2021-12-16 06:01:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:16,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:01:16,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:16,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:01:16,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:01:16,301 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-16 06:01:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:16,321 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-16 06:01:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:01:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-16 06:01:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:16,324 INFO L225 Difference]: With dead ends: 158 [2021-12-16 06:01:16,324 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 06:01:16,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-16 06:01:16,325 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:16,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 141 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:01:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 06:01:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2021-12-16 06:01:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-16 06:01:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-16 06:01:16,329 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 19 [2021-12-16 06:01:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:16,329 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-16 06:01:16,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-16 06:01:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-12-16 06:01:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 06:01:16,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:16,330 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-16 06:01:16,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:16,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:16,537 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972818, now seen corresponding path program 1 times [2021-12-16 06:01:16,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:16,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723686031] [2021-12-16 06:01:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:16,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:16,539 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:16,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 06:01:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:16,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:01:16,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:16,646 INFO L388 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 19 treesize of output 11 [2021-12-16 06:01:16,654 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-16 06:01:16,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:16,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723686031] [2021-12-16 06:01:16,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723686031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:16,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:16,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:01:16,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875677503] [2021-12-16 06:01:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:16,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:01:16,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:01:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:01:16,656 INFO L87 Difference]: Start difference. First operand 103 states and 116 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-16 06:01:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:16,844 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2021-12-16 06:01:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:01:16,845 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-16 06:01:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:16,845 INFO L225 Difference]: With dead ends: 102 [2021-12-16 06:01:16,845 INFO L226 Difference]: Without dead ends: 102 [2021-12-16 06:01:16,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:16,846 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:16,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-16 06:01:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-16 06:01:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-16 06:01:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2021-12-16 06:01:16,848 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2021-12-16 06:01:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:16,849 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2021-12-16 06:01:16,849 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-16 06:01:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2021-12-16 06:01:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 06:01:16,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:16,849 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-16 06:01:16,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:17,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:17,050 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972817, now seen corresponding path program 1 times [2021-12-16 06:01:17,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:17,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077614508] [2021-12-16 06:01:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:17,050 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:17,051 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:17,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-16 06:01:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:17,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 06:01:17,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:17,225 INFO L388 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 23 treesize of output 15 [2021-12-16 06:01:17,230 INFO L388 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 34 treesize of output 18 [2021-12-16 06:01:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:17,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:17,257 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:17,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077614508] [2021-12-16 06:01:17,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077614508] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:17,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:17,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:01:17,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332862109] [2021-12-16 06:01:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:17,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:01:17,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:01:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:01:17,258 INFO L87 Difference]: Start difference. First operand 102 states and 114 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-16 06:01:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:17,646 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-12-16 06:01:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:01:17,646 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-16 06:01:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:17,647 INFO L225 Difference]: With dead ends: 101 [2021-12-16 06:01:17,647 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 06:01:17,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:01:17,648 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 24 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:17,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:01:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 06:01:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 06:01:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-16 06:01:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-12-16 06:01:17,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 20 [2021-12-16 06:01:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:17,659 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-12-16 06:01:17,659 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-16 06:01:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-12-16 06:01:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 06:01:17,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:17,660 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] [2021-12-16 06:01:17,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:17,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:17,867 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1226162375, now seen corresponding path program 1 times [2021-12-16 06:01:17,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:17,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531500108] [2021-12-16 06:01:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:17,868 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:17,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:17,869 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:17,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-16 06:01:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:17,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 06:01:17,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:17,986 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:18,021 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:01:18,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 06:01:18,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-16 06:01:18,109 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:18,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-16 06:01:18,135 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:18,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-16 06:01:18,178 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:18,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-16 06:01:18,201 INFO L388 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 24 treesize of output 12 [2021-12-16 06:01:18,224 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-16 06:01:18,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:01:18,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-16 06:01:18,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-16 06:01:18,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-16 06:01:18,355 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:18,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2021-12-16 06:01:18,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:18,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-16 06:01:18,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-16 06:01:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-16 06:01:18,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531500108] [2021-12-16 06:01:18,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531500108] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:01:18,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:01:18,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-12-16 06:01:18,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427238517] [2021-12-16 06:01:18,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:01:18,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 06:01:18,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 06:01:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2021-12-16 06:01:18,490 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-16 06:01:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:19,289 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2021-12-16 06:01:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 06:01:19,289 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-16 06:01:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:19,290 INFO L225 Difference]: With dead ends: 198 [2021-12-16 06:01:19,290 INFO L226 Difference]: Without dead ends: 198 [2021-12-16 06:01:19,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=290, Unknown=3, NotChecked=114, Total=506 [2021-12-16 06:01:19,291 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 164 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:19,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 537 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 534 Invalid, 0 Unknown, 461 Unchecked, 0.6s Time] [2021-12-16 06:01:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-16 06:01:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 120. [2021-12-16 06:01:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 0 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-16 06:01:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2021-12-16 06:01:19,293 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 21 [2021-12-16 06:01:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:19,293 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2021-12-16 06:01:19,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-16 06:01:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2021-12-16 06:01:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 06:01:19,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:19,294 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] [2021-12-16 06:01:19,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:19,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:19,494 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 960368175, now seen corresponding path program 1 times [2021-12-16 06:01:19,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:19,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259507969] [2021-12-16 06:01:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:19,495 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:19,496 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:19,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-16 06:01:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:19,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:01:19,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:19,608 INFO L388 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 19 treesize of output 11 [2021-12-16 06:01:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:19,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:19,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:19,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259507969] [2021-12-16 06:01:19,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259507969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:19,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:19,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:01:19,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917426871] [2021-12-16 06:01:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:19,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:01:19,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:01:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:01:19,623 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-16 06:01:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:19,875 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2021-12-16 06:01:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:01:19,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-16 06:01:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:19,876 INFO L225 Difference]: With dead ends: 122 [2021-12-16 06:01:19,876 INFO L226 Difference]: Without dead ends: 122 [2021-12-16 06:01:19,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:01:19,876 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:19,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 139 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:01:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-16 06:01:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-12-16 06:01:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 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-16 06:01:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2021-12-16 06:01:19,878 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 22 [2021-12-16 06:01:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:19,879 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2021-12-16 06:01:19,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-16 06:01:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2021-12-16 06:01:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 06:01:19,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:19,879 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] [2021-12-16 06:01:19,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-16 06:01:20,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:20,086 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 960368176, now seen corresponding path program 1 times [2021-12-16 06:01:20,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:20,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225336017] [2021-12-16 06:01:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:20,087 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:20,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:20,088 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:20,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-16 06:01:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:20,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 06:01:20,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:20,274 INFO L388 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 23 treesize of output 15 [2021-12-16 06:01:20,276 INFO L388 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 34 treesize of output 18 [2021-12-16 06:01:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:20,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:20,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:20,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225336017] [2021-12-16 06:01:20,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225336017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:20,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:20,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:01:20,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717058654] [2021-12-16 06:01:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:20,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:01:20,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:01:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:01:20,340 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-16 06:01:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:20,964 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2021-12-16 06:01:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:01:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-16 06:01:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:20,965 INFO L225 Difference]: With dead ends: 122 [2021-12-16 06:01:20,965 INFO L226 Difference]: Without dead ends: 122 [2021-12-16 06:01:20,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 06:01:20,966 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 57 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:20,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 06:01:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-16 06:01:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-12-16 06:01:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 120 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-16 06:01:20,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2021-12-16 06:01:20,973 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 22 [2021-12-16 06:01:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:20,973 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2021-12-16 06:01:20,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-16 06:01:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2021-12-16 06:01:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 06:01:20,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:20,974 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] [2021-12-16 06:01:20,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-16 06:01:21,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:21,175 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:21,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -643667878, now seen corresponding path program 1 times [2021-12-16 06:01:21,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:21,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982834127] [2021-12-16 06:01:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:21,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:21,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:21,176 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:21,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-16 06:01:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:21,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 06:01:21,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:21,291 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-16 06:01:21,292 INFO L388 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 12 treesize of output 21 [2021-12-16 06:01:21,376 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-16 06:01:21,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-16 06:01:21,435 INFO L388 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-16 06:01:21,608 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:21,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2021-12-16 06:01:21,665 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:21,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2021-12-16 06:01:21,752 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:21,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2021-12-16 06:01:21,800 INFO L388 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 46 treesize of output 30 [2021-12-16 06:01:21,958 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-16 06:01:21,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:01:22,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-16 06:01:22,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-16 06:01:22,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_577) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-16 06:01:22,057 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:22,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 23 [2021-12-16 06:01:22,066 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:22,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2021-12-16 06:01:22,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-16 06:01:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-16 06:01:35,008 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982834127] [2021-12-16 06:01:35,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982834127] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:01:35,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:01:35,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2021-12-16 06:01:35,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725188769] [2021-12-16 06:01:35,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:01:35,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 06:01:35,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 06:01:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=246, Unknown=5, NotChecked=102, Total=420 [2021-12-16 06:01:35,009 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-16 06:01:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:36,090 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2021-12-16 06:01:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 06:01:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 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 22 [2021-12-16 06:01:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:36,092 INFO L225 Difference]: With dead ends: 223 [2021-12-16 06:01:36,092 INFO L226 Difference]: Without dead ends: 223 [2021-12-16 06:01:36,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=212, Invalid=725, Unknown=5, NotChecked=180, Total=1122 [2021-12-16 06:01:36,093 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 308 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 625 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:36,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 440 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 473 Invalid, 0 Unknown, 625 Unchecked, 0.6s Time] [2021-12-16 06:01:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-16 06:01:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2021-12-16 06:01:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 122 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-16 06:01:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2021-12-16 06:01:36,095 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 22 [2021-12-16 06:01:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:36,095 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2021-12-16 06:01:36,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-16 06:01:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2021-12-16 06:01:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-16 06:01:36,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:36,096 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] [2021-12-16 06:01:36,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-16 06:01:36,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:36,304 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash -643667877, now seen corresponding path program 1 times [2021-12-16 06:01:36,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:36,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142734092] [2021-12-16 06:01:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:36,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:36,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:36,306 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:36,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-16 06:01:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:36,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 06:01:36,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:36,413 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:36,447 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:01:36,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 06:01:36,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-16 06:01:36,480 INFO L388 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-16 06:01:36,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:36,592 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 06:01:36,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-16 06:01:36,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-16 06:01:36,611 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:36,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-16 06:01:36,647 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:36,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-16 06:01:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:36,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 06:01:36,716 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:01:36,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-16 06:01:36,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-16 06:01:36,747 INFO L388 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 25 treesize of output 13 [2021-12-16 06:01:36,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-16 06:01:36,817 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-16 06:01:36,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:01:37,010 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-16 06:01:37,084 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-16 06:01:37,109 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_628) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-16 06:01:37,130 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:37,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 30 [2021-12-16 06:01:37,147 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:37,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-16 06:01:37,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-16 06:01:37,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:37,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 38 [2021-12-16 06:01:37,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:01:37,212 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-16 06:01:37,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:01:37,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-16 06:01:37,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:01:37,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-16 06:01:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-16 06:01:37,354 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:37,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142734092] [2021-12-16 06:01:37,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142734092] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:01:37,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:01:37,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-16 06:01:37,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209085026] [2021-12-16 06:01:37,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:01:37,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 06:01:37,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 06:01:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-16 06:01:37,355 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-16 06:01:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:39,432 INFO L93 Difference]: Finished difference Result 210 states and 232 transitions. [2021-12-16 06:01:39,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 06:01:39,433 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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 22 [2021-12-16 06:01:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:39,434 INFO L225 Difference]: With dead ends: 210 [2021-12-16 06:01:39,434 INFO L226 Difference]: Without dead ends: 210 [2021-12-16 06:01:39,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=662, Unknown=3, NotChecked=168, Total=992 [2021-12-16 06:01:39,434 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 200 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:39,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 447 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 598 Invalid, 0 Unknown, 559 Unchecked, 1.2s Time] [2021-12-16 06:01:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-16 06:01:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 126. [2021-12-16 06:01:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.311926605504587) internal successors, (143), 125 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-16 06:01:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2021-12-16 06:01:39,437 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 22 [2021-12-16 06:01:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:39,438 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2021-12-16 06:01:39,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-16 06:01:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2021-12-16 06:01:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:01:39,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:39,438 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] [2021-12-16 06:01:39,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:39,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:39,647 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 977716951, now seen corresponding path program 1 times [2021-12-16 06:01:39,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618884388] [2021-12-16 06:01:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:39,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:39,649 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:39,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-16 06:01:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:39,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-16 06:01:39,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:39,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:39,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:01:39,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:39,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:39,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:39,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:39,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:39,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:39,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:39,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:01:39,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:01:46,271 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 06:01:46,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2021-12-16 06:01:46,277 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 06:01:46,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2021-12-16 06:01:46,303 INFO L388 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 22 treesize of output 10 [2021-12-16 06:01:46,339 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-16 06:01:46,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:46,339 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:46,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618884388] [2021-12-16 06:01:46,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618884388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:46,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:46,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 06:01:46,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998601680] [2021-12-16 06:01:46,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:46,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 06:01:46,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 06:01:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=102, Unknown=3, NotChecked=0, Total=132 [2021-12-16 06:01:46,341 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-16 06:01:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:46,711 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2021-12-16 06:01:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 06:01:46,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-12-16 06:01:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:46,712 INFO L225 Difference]: With dead ends: 144 [2021-12-16 06:01:46,712 INFO L226 Difference]: Without dead ends: 144 [2021-12-16 06:01:46,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=53, Invalid=184, Unknown=3, NotChecked=0, Total=240 [2021-12-16 06:01:46,712 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 44 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:46,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 531 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 135 Unchecked, 0.2s Time] [2021-12-16 06:01:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-16 06:01:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2021-12-16 06:01:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 131 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-16 06:01:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2021-12-16 06:01:46,715 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 23 [2021-12-16 06:01:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:46,715 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2021-12-16 06:01:46,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-16 06:01:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2021-12-16 06:01:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:01:46,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:46,715 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:46,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-16 06:01:46,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:46,916 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash -504150028, now seen corresponding path program 1 times [2021-12-16 06:01:46,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:46,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112646367] [2021-12-16 06:01:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:46,917 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:46,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:46,918 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:46,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-16 06:01:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:46,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 06:01:46,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:47,080 INFO L388 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 25 treesize of output 17 [2021-12-16 06:01:47,082 INFO L388 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 21 treesize of output 13 [2021-12-16 06:01:47,114 INFO L388 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 19 treesize of output 7 [2021-12-16 06:01:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:01:47,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:01:47,127 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 06:01:47,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112646367] [2021-12-16 06:01:47,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112646367] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:01:47,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:01:47,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 06:01:47,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524871100] [2021-12-16 06:01:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:01:47,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:01:47,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 06:01:47,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:01:47,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:01:47,128 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-16 06:01:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:48,284 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2021-12-16 06:01:48,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:01:48,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-12-16 06:01:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:48,286 INFO L225 Difference]: With dead ends: 143 [2021-12-16 06:01:48,287 INFO L226 Difference]: Without dead ends: 143 [2021-12-16 06:01:48,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-16 06:01:48,287 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:48,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 283 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:01:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-16 06:01:48,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2021-12-16 06:01:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 139 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-16 06:01:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2021-12-16 06:01:48,290 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 24 [2021-12-16 06:01:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:48,290 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2021-12-16 06:01:48,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-16 06:01:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2021-12-16 06:01:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:01:48,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:48,291 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-16 06:01:48,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-16 06:01:48,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 06:01:48,499 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 06:01:48,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1519298741, now seen corresponding path program 1 times [2021-12-16 06:01:48,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 06:01:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99777607] [2021-12-16 06:01:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:48,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 06:01:48,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 06:01:48,501 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 06:01:48,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-16 06:01:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:48,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 06:01:48,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:48,637 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:48,674 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:01:48,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 06:01:48,697 INFO L388 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-16 06:01:48,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:01:48,817 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 06:01:48,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-16 06:01:48,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 06:01:48,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 06:01:48,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:01:48,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-16 06:01:48,959 INFO L354 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2021-12-16 06:01:48,960 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 48 [2021-12-16 06:01:48,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-16 06:01:49,004 INFO L388 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 23 treesize of output 15 [2021-12-16 06:01:49,141 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-16 06:01:49,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2021-12-16 06:01:49,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-16 06:01:49,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:01:49,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (_ BitVec 32)) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv4 32)) v_ArrVal_735)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv1 1)))) is different from false [2021-12-16 06:01:49,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (_ BitVec 32)) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv4 32)) v_ArrVal_735)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv1 1)))) is different from false [2021-12-16 06:01:49,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (_ BitVec 32)) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd .cse2 (_ bv4 32)) v_ArrVal_735))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_734) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (_ bv1 1)))) is different from false [2021-12-16 06:01:49,576 INFO L354 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2021-12-16 06:01:49,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 115403 treesize of output 109729