./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 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/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:02:48,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:02:48,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:02:48,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:02:48,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:02:48,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:02:48,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:02:48,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:02:48,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:02:48,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:02:48,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:02:48,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:02:48,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:02:48,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:02:48,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:02:48,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:02:48,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:02:48,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:02:48,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:02:48,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:02:48,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:02:48,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:02:48,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:02:48,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:02:48,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:02:48,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:02:48,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:02:48,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:02:48,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:02:48,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:02:48,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:02:48,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:02:48,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:02:48,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:02:48,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:02:48,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:02:48,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:02:48,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:02:48,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:02:48,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:02:48,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:02:48,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-12-21 18:02:48,187 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:02:48,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:02:48,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:02:48,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:02:48,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:02:48,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:02:48,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:02:48,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:02:48,191 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:02:48,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:02:48,192 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:02:48,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:02:48,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:02:48,192 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:02:48,193 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:02:48,193 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:02:48,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:02:48,193 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:02:48,193 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:02:48,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:02:48,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:02:48,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:02:48,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:02:48,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:02:48,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:02:48,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:02:48,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:02:48,195 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:02:48,195 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2021-12-21 18:02:48,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:02:48,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:02:48,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:02:48,396 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:02:48,396 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:02:48,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2021-12-21 18:02:48,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009fd5f04/ab3df9762eef4a40a2324a61af321a03/FLAG315788306 [2021-12-21 18:02:48,793 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:02:48,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2021-12-21 18:02:48,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009fd5f04/ab3df9762eef4a40a2324a61af321a03/FLAG315788306 [2021-12-21 18:02:48,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009fd5f04/ab3df9762eef4a40a2324a61af321a03 [2021-12-21 18:02:48,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:02:48,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:02:48,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:02:48,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:02:48,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:02:48,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:02:48" (1/1) ... [2021-12-21 18:02:48,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be58fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:48, skipping insertion in model container [2021-12-21 18:02:48,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:02:48" (1/1) ... [2021-12-21 18:02:48,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:02:48,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:02:48,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:02:48,982 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:02:48,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:02:49,008 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:02:49,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49 WrapperNode [2021-12-21 18:02:49,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:02:49,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:02:49,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:02:49,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:02:49,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,032 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2021-12-21 18:02:49,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:02:49,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:02:49,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:02:49,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:02:49,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:02:49,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:02:49,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:02:49,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:02:49,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (1/1) ... [2021-12-21 18:02:49,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:02:49,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:02:49,086 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-21 18:02:49,092 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-21 18:02:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 18:02:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:02:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:02:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 18:02:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 18:02:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:02:49,154 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:02:49,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:02:49,233 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:02:49,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:02:49,237 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 18:02:49,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:02:49 BoogieIcfgContainer [2021-12-21 18:02:49,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:02:49,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:02:49,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:02:49,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:02:49,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:02:48" (1/3) ... [2021-12-21 18:02:49,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6e6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:02:49, skipping insertion in model container [2021-12-21 18:02:49,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:02:49" (2/3) ... [2021-12-21 18:02:49,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6e6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:02:49, skipping insertion in model container [2021-12-21 18:02:49,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:02:49" (3/3) ... [2021-12-21 18:02:49,244 INFO L111 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2021-12-21 18:02:49,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:02:49,249 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-12-21 18:02:49,276 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:02:49,281 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-21 18:02:49,281 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-21 18:02:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:02:49,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:49,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:02:49,295 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-21 18:02:49,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:49,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934188017] [2021-12-21 18:02:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:49,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:49,406 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-21 18:02:49,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934188017] [2021-12-21 18:02:49,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934188017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:02:49,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:02:49,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:02:49,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158377245] [2021-12-21 18:02:49,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:02:49,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:02:49,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:49,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:02:49,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:02:49,434 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:49,486 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-12-21 18:02:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:02:49,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-21 18:02:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:49,496 INFO L225 Difference]: With dead ends: 20 [2021-12-21 18:02:49,498 INFO L226 Difference]: Without dead ends: 18 [2021-12-21 18:02:49,500 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-21 18:02:49,505 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:02:49,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-21 18:02:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-21 18:02:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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-21 18:02:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-12-21 18:02:49,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 4 [2021-12-21 18:02:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:49,531 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-21 18:02:49,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-12-21 18:02:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:02:49,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:49,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:02:49,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:02:49,542 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2021-12-21 18:02:49,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:49,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254001410] [2021-12-21 18:02:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:49,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:49,634 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-21 18:02:49,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:49,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254001410] [2021-12-21 18:02:49,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254001410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:02:49,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:02:49,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:02:49,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840522779] [2021-12-21 18:02:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:02:49,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:02:49,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:49,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:02:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:02:49,640 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:49,665 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-12-21 18:02:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:02:49,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-21 18:02:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:49,667 INFO L225 Difference]: With dead ends: 22 [2021-12-21 18:02:49,667 INFO L226 Difference]: Without dead ends: 22 [2021-12-21 18:02:49,667 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-21 18:02:49,671 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:02:49,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-21 18:02:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2021-12-21 18:02:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 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-21 18:02:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-21 18:02:49,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2021-12-21 18:02:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:49,680 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-21 18:02:49,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-21 18:02:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-21 18:02:49,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:49,681 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:49,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:02:49,682 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 264435913, now seen corresponding path program 1 times [2021-12-21 18:02:49,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:49,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311957978] [2021-12-21 18:02:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:49,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:49,815 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-21 18:02:49,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:49,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311957978] [2021-12-21 18:02:49,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311957978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:02:49,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642889445] [2021-12-21 18:02:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:49,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:02:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:02:49,821 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-21 18:02:49,822 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-21 18:02:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:49,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:02:49,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:02:49,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:02:50,000 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-21 18:02:50,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:02:50,063 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-21 18:02:50,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642889445] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:02:50,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:02:50,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2021-12-21 18:02:50,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172828991] [2021-12-21 18:02:50,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:02:50,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:02:50,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:02:50,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:02:50,066 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 8 states have (on average 2.75) 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-21 18:02:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:50,151 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2021-12-21 18:02:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:02:50,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) 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 8 [2021-12-21 18:02:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:50,153 INFO L225 Difference]: With dead ends: 30 [2021-12-21 18:02:50,153 INFO L226 Difference]: Without dead ends: 30 [2021-12-21 18:02:50,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:02:50,156 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:02:50,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 57 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-21 18:02:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-21 18:02:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-21 18:02:50,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2021-12-21 18:02:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:50,163 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-21 18:02:50,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) 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-21 18:02:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-21 18:02:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:02:50,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:50,165 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:50,187 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-21 18:02:50,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:02:50,380 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1080369951, now seen corresponding path program 1 times [2021-12-21 18:02:50,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:50,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72215812] [2021-12-21 18:02:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:50,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 18:02:50,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:50,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72215812] [2021-12-21 18:02:50,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72215812] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:02:50,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:02:50,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:02:50,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130285338] [2021-12-21 18:02:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:02:50,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:02:50,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:50,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:02:50,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:02:50,470 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:50,511 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-21 18:02:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:02:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-21 18:02:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:50,512 INFO L225 Difference]: With dead ends: 33 [2021-12-21 18:02:50,512 INFO L226 Difference]: Without dead ends: 33 [2021-12-21 18:02:50,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:02:50,513 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:02:50,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-21 18:02:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-21 18:02:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2021-12-21 18:02:50,516 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2021-12-21 18:02:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:50,516 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-12-21 18:02:50,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2021-12-21 18:02:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 18:02:50,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:50,517 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:50,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:02:50,517 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash 868275973, now seen corresponding path program 1 times [2021-12-21 18:02:50,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:50,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137792937] [2021-12-21 18:02:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:50,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 18:02:50,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:50,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137792937] [2021-12-21 18:02:50,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137792937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:02:50,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:02:50,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:02:50,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184580781] [2021-12-21 18:02:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:02:50,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:02:50,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:50,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:02:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:02:50,558 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:50,566 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2021-12-21 18:02:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:02:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 18:02:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:50,567 INFO L225 Difference]: With dead ends: 30 [2021-12-21 18:02:50,567 INFO L226 Difference]: Without dead ends: 30 [2021-12-21 18:02:50,568 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-21 18:02:50,569 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 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-21 18:02:50,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-21 18:02:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-21 18:02:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-21 18:02:50,571 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2021-12-21 18:02:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:50,571 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-21 18:02:50,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-21 18:02:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:02:50,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:50,572 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:50,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:02:50,572 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1146749636, now seen corresponding path program 1 times [2021-12-21 18:02:50,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523587114] [2021-12-21 18:02:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:50,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:02:50,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:50,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523587114] [2021-12-21 18:02:50,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523587114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:02:50,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055495476] [2021-12-21 18:02:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:50,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:02:50,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:02:50,623 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-21 18:02:50,625 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-21 18:02:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:50,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:02:50,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:02:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:02:50,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:02:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:02:50,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055495476] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:02:50,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:02:50,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-21 18:02:50,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197588109] [2021-12-21 18:02:50,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:02:50,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:02:50,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:50,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:02:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:02:50,791 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-21 18:02:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:50,829 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2021-12-21 18:02:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:02:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 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-21 18:02:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:50,830 INFO L225 Difference]: With dead ends: 54 [2021-12-21 18:02:50,830 INFO L226 Difference]: Without dead ends: 54 [2021-12-21 18:02:50,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:02:50,832 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:02:50,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-21 18:02:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-21 18:02:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-21 18:02:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-21 18:02:50,842 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 24 [2021-12-21 18:02:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:50,842 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-21 18:02:50,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-21 18:02:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-12-21 18:02:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-21 18:02:50,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:50,845 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:50,863 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-21 18:02:51,061 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,SelfDestructingSolverStorable5 [2021-12-21 18:02:51,061 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1408662102, now seen corresponding path program 2 times [2021-12-21 18:02:51,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:51,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964635064] [2021-12-21 18:02:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:51,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:02:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 18:02:51,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:02:51,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964635064] [2021-12-21 18:02:51,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964635064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:02:51,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:02:51,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:02:51,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894763849] [2021-12-21 18:02:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:02:51,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:02:51,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:02:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:02:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:02:51,167 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:02:51,179 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2021-12-21 18:02:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:02:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-21 18:02:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:02:51,182 INFO L225 Difference]: With dead ends: 53 [2021-12-21 18:02:51,182 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 18:02:51,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:02:51,183 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:02:51,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:02:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 18:02:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-21 18:02:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-21 18:02:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-12-21 18:02:51,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2021-12-21 18:02:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:02:51,191 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-12-21 18:02:51,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:02:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-12-21 18:02:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-21 18:02:51,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:02:51,192 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:51,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 18:02:51,193 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2021-12-21 18:02:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:02:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 713028304, now seen corresponding path program 1 times [2021-12-21 18:02:51,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:02:51,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468664002] [2021-12-21 18:02:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:02:51,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:02:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:02:51,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 18:02:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:02:51,310 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 18:02:51,311 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 18:02:51,311 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (6 of 7 remaining) [2021-12-21 18:02:51,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (5 of 7 remaining) [2021-12-21 18:02:51,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (4 of 7 remaining) [2021-12-21 18:02:51,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (3 of 7 remaining) [2021-12-21 18:02:51,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (2 of 7 remaining) [2021-12-21 18:02:51,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (1 of 7 remaining) [2021-12-21 18:02:51,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2021-12-21 18:02:51,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 18:02:51,315 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2021-12-21 18:02:51,320 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 18:02:51,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:02:51 BoogieIcfgContainer [2021-12-21 18:02:51,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 18:02:51,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 18:02:51,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 18:02:51,360 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 18:02:51,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:02:49" (3/4) ... [2021-12-21 18:02:51,361 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 18:02:51,403 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 18:02:51,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 18:02:51,406 INFO L158 Benchmark]: Toolchain (without parser) took 2589.78ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 72.1MB in the beginning and 81.0MB in the end (delta: -8.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2021-12-21 18:02:51,406 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 57.7MB in the beginning and 57.6MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:02:51,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.14ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 77.8MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 18:02:51,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.78ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 76.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:02:51,407 INFO L158 Benchmark]: Boogie Preprocessor took 26.25ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 74.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:02:51,407 INFO L158 Benchmark]: RCFGBuilder took 177.39ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 65.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:02:51,407 INFO L158 Benchmark]: TraceAbstraction took 2119.46ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.4MB in the beginning and 84.0MB in the end (delta: -19.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2021-12-21 18:02:51,408 INFO L158 Benchmark]: Witness Printer took 45.66ms. Allocated memory is still 121.6MB. Free memory was 84.0MB in the beginning and 81.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 18:02:51,409 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.19ms. Allocated memory is still 100.7MB. Free memory was 57.7MB in the beginning and 57.6MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.14ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 77.8MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.78ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 76.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.25ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 74.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 177.39ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 65.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2119.46ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.4MB in the beginning and 84.0MB in the end (delta: -19.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 45.66ms. Allocated memory is still 121.6MB. Free memory was 84.0MB in the beginning and 81.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, a={2:0}, i=0, n=0] [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, a={2:0}, i=0, n=1] [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, a={2:0}, i=0, n=2] [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={2:0}, i=0, n=3] [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, a={2:0}, i=0, n=4] [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=5, a={2:0}, i=0, n=5] [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, a={2:0}, i=0, n=6] [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=6, a={2:0}, i=0, n=7] [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, a={2:0}, i=0, n=8] [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=7, a={2:0}, i=0, n=9] [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, i=0, n=10] [L17] EXPR a[i] VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=9, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=9, i=0, n=10] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - UnprovableResult [Line: 14]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 100 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 246/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-21 18:02:51,437 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)