./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s5lif.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:34:16,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:34:16,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:34:16,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:34:16,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:34:16,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:34:16,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:34:16,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:34:16,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:34:16,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:34:16,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:34:16,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:34:16,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:34:16,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:34:16,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:34:16,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:34:16,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:34:16,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:34:16,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:34:16,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:34:16,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:34:16,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:34:16,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:34:16,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:34:16,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:34:16,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:34:16,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:34:16,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:34:16,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:34:16,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:34:16,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:34:16,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:34:16,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:34:16,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:34:16,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:34:16,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:34:16,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:34:16,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:34:16,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:34:16,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:34:16,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:34:16,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:34:16,393 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:34:16,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:34:16,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:34:16,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:34:16,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:34:16,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:34:16,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:34:16,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:34:16,399 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:34:16,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:34:16,400 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:34:16,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:34:16,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:34:16,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:34:16,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:34:16,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:34:16,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:34:16,402 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:34:16,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:34:16,402 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:34:16,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:34:16,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:34:16,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:34:16,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:34:16,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:34:16,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:34:16,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:34:16,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:34:16,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:34:16,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:34:16,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:34:16,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:34:16,404 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:34:16,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:34:16,405 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:34:16,405 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2023-02-16 00:34:16,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:34:16,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:34:16,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:34:16,632 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:34:16,632 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:34:16,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5lif.c [2023-02-16 00:34:17,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:34:17,882 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:34:17,883 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c [2023-02-16 00:34:17,887 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe053535/6d7c2b53d3454e3397e6ee136bb68dea/FLAGeec83083b [2023-02-16 00:34:17,898 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe053535/6d7c2b53d3454e3397e6ee136bb68dea [2023-02-16 00:34:17,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:34:17,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:34:17,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:34:17,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:34:17,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:34:17,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:34:17" (1/1) ... [2023-02-16 00:34:17,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456a7c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:17, skipping insertion in model container [2023-02-16 00:34:17,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:34:17" (1/1) ... [2023-02-16 00:34:17,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:34:17,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:34:18,034 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2023-02-16 00:34:18,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:34:18,057 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:34:18,068 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2023-02-16 00:34:18,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:34:18,086 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:34:18,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18 WrapperNode [2023-02-16 00:34:18,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:34:18,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:34:18,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:34:18,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:34:18,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,136 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-02-16 00:34:18,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:34:18,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:34:18,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:34:18,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:34:18,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:34:18,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:34:18,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:34:18,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:34:18,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (1/1) ... [2023-02-16 00:34:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:34:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:18,212 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) [2023-02-16 00:34:18,213 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 [2023-02-16 00:34:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:34:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:34:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:34:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:34:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:34:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:34:18,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:34:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:34:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:34:18,317 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:34:18,320 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:34:18,550 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:34:18,555 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:34:18,555 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:34:18,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:34:18 BoogieIcfgContainer [2023-02-16 00:34:18,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:34:18,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:34:18,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:34:18,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:34:18,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:34:17" (1/3) ... [2023-02-16 00:34:18,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34806024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:34:18, skipping insertion in model container [2023-02-16 00:34:18,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:34:18" (2/3) ... [2023-02-16 00:34:18,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34806024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:34:18, skipping insertion in model container [2023-02-16 00:34:18,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:34:18" (3/3) ... [2023-02-16 00:34:18,564 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2023-02-16 00:34:18,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:34:18,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:34:18,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:34:18,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44b93e66, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:34:18,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:34:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:34:18,632 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:18,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:18,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2023-02-16 00:34:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719385771] [2023-02-16 00:34:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:18,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719385771] [2023-02-16 00:34:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719385771] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:34:18,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:34:18,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:34:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798553200] [2023-02-16 00:34:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:34:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:34:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:34:18,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:34:18,875 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:18,891 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-02-16 00:34:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:34:18,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 00:34:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:18,897 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:34:18,897 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 00:34:18,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:34:18,902 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:18,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:34:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 00:34:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 00:34:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-02-16 00:34:18,927 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-02-16 00:34:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:18,928 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-02-16 00:34:18,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-02-16 00:34:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:34:18,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:18,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:18,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:34:18,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2023-02-16 00:34:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:18,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849686055] [2023-02-16 00:34:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:19,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849686055] [2023-02-16 00:34:19,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849686055] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:34:19,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:34:19,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:34:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783063814] [2023-02-16 00:34:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:34:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:34:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:19,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:34:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:34:19,076 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:19,125 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-02-16 00:34:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:34:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 00:34:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:19,126 INFO L225 Difference]: With dead ends: 36 [2023-02-16 00:34:19,126 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 00:34:19,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:34:19,128 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:19,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:34:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 00:34:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-02-16 00:34:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-16 00:34:19,134 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2023-02-16 00:34:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:19,134 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-16 00:34:19,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-16 00:34:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:34:19,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:19,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:19,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:34:19,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2023-02-16 00:34:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:19,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642198781] [2023-02-16 00:34:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:19,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:20,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642198781] [2023-02-16 00:34:20,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642198781] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:20,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27647129] [2023-02-16 00:34:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:20,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:20,269 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) [2023-02-16 00:34:20,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:34:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:20,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 00:34:20,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:20,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:34:20,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:34:20,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:34:20,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-02-16 00:34:20,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-16 00:34:20,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-02-16 00:34:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:20,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:21,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:34:21,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2023-02-16 00:34:21,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:34:21,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-02-16 00:34:21,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:34:21,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2023-02-16 00:34:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:21,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27647129] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:21,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 32 [2023-02-16 00:34:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904404147] [2023-02-16 00:34:21,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:21,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-16 00:34:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-16 00:34:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2023-02-16 00:34:21,465 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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) [2023-02-16 00:34:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:22,788 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-02-16 00:34:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 00:34:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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) Word has length 20 [2023-02-16 00:34:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:22,791 INFO L225 Difference]: With dead ends: 53 [2023-02-16 00:34:22,791 INFO L226 Difference]: Without dead ends: 49 [2023-02-16 00:34:22,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=535, Invalid=1915, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 00:34:22,793 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:22,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 77 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:34:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-16 00:34:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2023-02-16 00:34:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-16 00:34:22,802 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2023-02-16 00:34:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:22,802 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-16 00:34:22,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 32 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) [2023-02-16 00:34:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-16 00:34:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:34:22,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:22,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:22,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:34:23,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:23,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2023-02-16 00:34:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109411277] [2023-02-16 00:34:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:23,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:23,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109411277] [2023-02-16 00:34:23,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109411277] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:23,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768419962] [2023-02-16 00:34:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:23,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:23,196 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) [2023-02-16 00:34:23,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:34:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:23,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 00:34:23,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:23,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:34:23,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:34:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:23,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:23,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-16 00:34:23,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-16 00:34:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:23,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768419962] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:23,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:23,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-16 00:34:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425248019] [2023-02-16 00:34:23,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:23,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:34:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:23,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:34:23,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:34:23,344 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:23,399 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-16 00:34:23,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 00:34:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 00:34:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:23,400 INFO L225 Difference]: With dead ends: 48 [2023-02-16 00:34:23,400 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:34:23,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:34:23,402 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:23,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:34:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:34:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-02-16 00:34:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-02-16 00:34:23,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2023-02-16 00:34:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:23,409 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-02-16 00:34:23,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-02-16 00:34:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:34:23,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:23,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:23,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:34:23,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 00:34:23,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2023-02-16 00:34:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:23,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913542947] [2023-02-16 00:34:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:23,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913542947] [2023-02-16 00:34:23,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913542947] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:23,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232093290] [2023-02-16 00:34:23,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:34:23,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:23,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:23,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:23,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:34:23,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:34:23,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:34:23,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:34:23,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:23,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:23,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232093290] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:23,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:23,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:34:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39411790] [2023-02-16 00:34:23,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:34:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:34:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:34:23,837 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2023-02-16 00:34:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:23,933 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2023-02-16 00:34:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:34:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 00:34:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:23,934 INFO L225 Difference]: With dead ends: 70 [2023-02-16 00:34:23,934 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 00:34:23,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:34:23,935 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:23,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 29 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:34:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 00:34:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2023-02-16 00:34:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-16 00:34:23,947 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-02-16 00:34:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:23,947 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-16 00:34:23,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2023-02-16 00:34:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-16 00:34:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:34:23,948 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:23,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:23,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:34:24,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:24,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2023-02-16 00:34:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:24,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249413550] [2023-02-16 00:34:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:24,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249413550] [2023-02-16 00:34:24,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249413550] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:24,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498381628] [2023-02-16 00:34:24,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:34:24,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:24,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:24,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:24,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:34:24,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:34:24,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:34:24,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:34:24,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:24,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:34:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498381628] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:24,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:34:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906986274] [2023-02-16 00:34:24,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:24,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:34:24,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:24,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:34:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:34:24,433 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:24,540 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-02-16 00:34:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:34:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 00:34:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:24,543 INFO L225 Difference]: With dead ends: 39 [2023-02-16 00:34:24,543 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 00:34:24,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:34:24,545 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:24,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:34:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 00:34:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-02-16 00:34:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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) [2023-02-16 00:34:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-16 00:34:24,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2023-02-16 00:34:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-16 00:34:24,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-16 00:34:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:34:24,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:24,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:24,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 00:34:24,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:24,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2023-02-16 00:34:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913442191] [2023-02-16 00:34:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:26,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913442191] [2023-02-16 00:34:26,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913442191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:26,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491034704] [2023-02-16 00:34:26,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:34:26,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:26,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:26,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:26,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:34:26,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:34:26,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:34:26,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-16 00:34:26,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:26,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:34:26,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:34:26,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:34:26,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:34:26,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-16 00:34:26,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:26,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2023-02-16 00:34:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:26,642 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:34:26,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-02-16 00:34:26,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2023-02-16 00:34:26,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2023-02-16 00:34:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:26,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:27,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:34:27,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2023-02-16 00:34:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:33,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491034704] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:33,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:33,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 49 [2023-02-16 00:34:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072444452] [2023-02-16 00:34:33,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:33,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 00:34:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 00:34:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1991, Unknown=0, NotChecked=0, Total=2352 [2023-02-16 00:34:33,704 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:52,367 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2023-02-16 00:34:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-02-16 00:34:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 00:34:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:52,369 INFO L225 Difference]: With dead ends: 99 [2023-02-16 00:34:52,369 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 00:34:52,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2505 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1327, Invalid=7045, Unknown=0, NotChecked=0, Total=8372 [2023-02-16 00:34:52,372 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:52,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 103 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-16 00:34:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 00:34:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2023-02-16 00:34:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2023-02-16 00:34:52,384 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 27 [2023-02-16 00:34:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:52,385 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-02-16 00:34:52,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2023-02-16 00:34:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:34:52,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:52,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:52,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:34:52,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:52,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2023-02-16 00:34:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904434246] [2023-02-16 00:34:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:34:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904434246] [2023-02-16 00:34:52,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904434246] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171742203] [2023-02-16 00:34:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:52,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:52,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 00:34:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:53,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 00:34:53,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:53,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-16 00:34:53,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:53,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-16 00:34:53,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-16 00:34:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:34:53,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:53,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-16 00:34:53,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-16 00:34:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:34:53,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171742203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:53,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:53,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-16 00:34:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681699239] [2023-02-16 00:34:53,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:53,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:34:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:53,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:34:53,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:34:53,220 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:53,406 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-02-16 00:34:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:34:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 00:34:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:53,408 INFO L225 Difference]: With dead ends: 79 [2023-02-16 00:34:53,408 INFO L226 Difference]: Without dead ends: 55 [2023-02-16 00:34:53,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:34:53,408 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:53,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:34:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-16 00:34:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2023-02-16 00:34:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-02-16 00:34:53,419 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2023-02-16 00:34:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:53,419 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-02-16 00:34:53,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-02-16 00:34:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:34:53,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:53,421 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:53,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:34:53,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:53,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2023-02-16 00:34:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:53,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297585747] [2023-02-16 00:34:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:34:53,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:53,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297585747] [2023-02-16 00:34:53,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297585747] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:53,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077035864] [2023-02-16 00:34:53,737 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:34:53,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:53,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 00:34:53,813 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 00:34:53,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:34:53,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:34:53,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:34:53,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:34:53,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077035864] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:53,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:53,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-16 00:34:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224154482] [2023-02-16 00:34:53,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:53,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:34:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:34:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:34:53,967 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:54,135 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-02-16 00:34:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:34:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 00:34:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:54,136 INFO L225 Difference]: With dead ends: 91 [2023-02-16 00:34:54,136 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 00:34:54,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:34:54,137 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:54,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 29 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:34:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 00:34:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2023-02-16 00:34:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-02-16 00:34:54,148 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2023-02-16 00:34:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:54,148 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-02-16 00:34:54,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-02-16 00:34:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:34:54,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:54,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:54,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:34:54,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:54,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2023-02-16 00:34:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:54,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501965031] [2023-02-16 00:34:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:34:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:54,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501965031] [2023-02-16 00:34:54,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501965031] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:54,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258824439] [2023-02-16 00:34:54,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:34:54,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:54,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 00:34:54,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-16 00:34:54,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:34:54,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:34:54,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:34:54,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:34:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:34:54,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258824439] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:34:54,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:34:54,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-16 00:34:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114010663] [2023-02-16 00:34:54,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:34:54,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:34:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:34:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:34:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:34:54,717 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) [2023-02-16 00:34:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:34:54,886 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-02-16 00:34:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:34:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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 29 [2023-02-16 00:34:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:34:54,886 INFO L225 Difference]: With dead ends: 48 [2023-02-16 00:34:54,887 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 00:34:54,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:34:54,888 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:34:54,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 26 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:34:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 00:34:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-02-16 00:34:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:34:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-02-16 00:34:54,895 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2023-02-16 00:34:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:34:54,895 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-02-16 00:34:54,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) [2023-02-16 00:34:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-02-16 00:34:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:34:54,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:34:54,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:34:54,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-16 00:34:55,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-16 00:34:55,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:34:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:34:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2023-02-16 00:34:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:34:55,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811900574] [2023-02-16 00:34:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:34:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:34:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:34:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811900574] [2023-02-16 00:34:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811900574] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:34:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011646862] [2023-02-16 00:34:57,582 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 00:34:57,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:34:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:34:57,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:34:57,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 00:34:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:34:57,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 83 conjunts are in the unsatisfiable core [2023-02-16 00:34:57,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:34:57,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:34:57,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:34:57,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:34:57,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:34:58,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:34:58,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-16 00:34:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2023-02-16 00:34:58,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-02-16 00:34:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:34:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-02-16 00:34:58,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:34:58,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:34:58,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2023-02-16 00:34:59,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-02-16 00:34:59,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2023-02-16 00:34:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:34:59,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:02,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:02,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2023-02-16 00:35:16,971 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-02-16 00:35:16,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-02-16 00:35:16,973 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-16 00:35:16,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:17,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:17,174 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 53 more [2023-02-16 00:35:17,177 INFO L158 Benchmark]: Toolchain (without parser) took 59276.02ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 118.4MB in the beginning and 161.7MB in the end (delta: -43.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2023-02-16 00:35:17,178 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:35:17,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.31ms. Allocated memory is still 153.1MB. Free memory was 118.4MB in the beginning and 107.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 00:35:17,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 105.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:35:17,178 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 153.1MB. Free memory was 105.8MB in the beginning and 104.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:35:17,178 INFO L158 Benchmark]: RCFGBuilder took 377.50ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 92.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 00:35:17,179 INFO L158 Benchmark]: TraceAbstraction took 58617.97ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 92.1MB in the beginning and 161.7MB in the end (delta: -69.6MB). Peak memory consumption was 395.2kB. Max. memory is 16.1GB. [2023-02-16 00:35:17,180 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.18ms. Allocated memory is still 111.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.31ms. Allocated memory is still 153.1MB. Free memory was 118.4MB in the beginning and 107.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 105.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 153.1MB. Free memory was 105.8MB in the beginning and 104.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.50ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 92.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 58617.97ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 92.1MB in the beginning and 161.7MB in the end (delta: -69.6MB). Peak memory consumption was 395.2kB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s5lif.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:35:18,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:35:18,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:35:18,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:35:18,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:35:18,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:35:18,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:35:18,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:35:18,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:35:18,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:35:18,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:35:18,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:35:18,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:35:18,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:35:18,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:35:18,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:35:18,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:35:19,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:35:19,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:35:19,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:35:19,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:35:19,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:35:19,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:35:19,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:35:19,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:35:19,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:35:19,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:35:19,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:35:19,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:35:19,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:35:19,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:35:19,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:35:19,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:35:19,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:35:19,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:35:19,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:35:19,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:35:19,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:35:19,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:35:19,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:35:19,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:35:19,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-16 00:35:19,069 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:35:19,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:35:19,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:35:19,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:35:19,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:35:19,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:35:19,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:35:19,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:35:19,074 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:35:19,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:35:19,075 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:35:19,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:35:19,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:35:19,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:35:19,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:35:19,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:35:19,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 00:35:19,076 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 00:35:19,076 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 00:35:19,076 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:35:19,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:35:19,077 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:35:19,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:35:19,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:35:19,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:35:19,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:35:19,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:35:19,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:35:19,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:35:19,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:35:19,079 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 00:35:19,079 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 00:35:19,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:35:19,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:35:19,079 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:35:19,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:35:19,080 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 00:35:19,080 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:35:19,080 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2023-02-16 00:35:19,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:35:19,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:35:19,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:35:19,418 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:35:19,418 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:35:19,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5lif.c [2023-02-16 00:35:20,562 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:35:20,760 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:35:20,760 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c [2023-02-16 00:35:20,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71830a9b/55deae641b86461aae4d16bcdf800ace/FLAGfd638230a [2023-02-16 00:35:20,777 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71830a9b/55deae641b86461aae4d16bcdf800ace [2023-02-16 00:35:20,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:35:20,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:35:20,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:35:20,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:35:20,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:35:20,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:35:20" (1/1) ... [2023-02-16 00:35:20,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd0b5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:20, skipping insertion in model container [2023-02-16 00:35:20,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:35:20" (1/1) ... [2023-02-16 00:35:20,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:35:20,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:35:20,970 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2023-02-16 00:35:20,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:35:21,010 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:35:21,028 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2023-02-16 00:35:21,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:35:21,060 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:35:21,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21 WrapperNode [2023-02-16 00:35:21,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:35:21,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:35:21,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:35:21,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:35:21,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,114 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2023-02-16 00:35:21,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:35:21,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:35:21,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:35:21,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:35:21,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:35:21,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:35:21,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:35:21,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:35:21,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (1/1) ... [2023-02-16 00:35:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:35:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:21,194 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) [2023-02-16 00:35:21,222 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 [2023-02-16 00:35:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:35:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 00:35:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:35:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2023-02-16 00:35:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:35:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 00:35:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:35:21,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:35:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-02-16 00:35:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:35:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 00:35:21,309 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:35:21,311 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:35:21,498 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:35:21,502 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:35:21,503 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:35:21,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:35:21 BoogieIcfgContainer [2023-02-16 00:35:21,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:35:21,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:35:21,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:35:21,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:35:21,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:35:20" (1/3) ... [2023-02-16 00:35:21,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d08668b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:35:21, skipping insertion in model container [2023-02-16 00:35:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:21" (2/3) ... [2023-02-16 00:35:21,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d08668b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:35:21, skipping insertion in model container [2023-02-16 00:35:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:35:21" (3/3) ... [2023-02-16 00:35:21,511 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2023-02-16 00:35:21,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:35:21,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:35:21,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:35:21,581 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f97958, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:35:21,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:35:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:35:21,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:21,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:21,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2023-02-16 00:35:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:21,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462263452] [2023-02-16 00:35:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:21,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:21,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:21,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 00:35:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:21,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 00:35:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:21,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:35:21,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:35:21,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462263452] [2023-02-16 00:35:21,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462263452] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:35:21,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:35:21,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:35:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049679700] [2023-02-16 00:35:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:35:21,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:35:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:35:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:35:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:35:21,862 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:21,879 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-02-16 00:35:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:35:21,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 00:35:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:21,888 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:35:21,888 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 00:35:21,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:35:21,901 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:21,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:35:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 00:35:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 00:35:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-02-16 00:35:21,931 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-02-16 00:35:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:21,932 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-02-16 00:35:21,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-02-16 00:35:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:35:21,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:21,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:21,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:22,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:22,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:22,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2023-02-16 00:35:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:22,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695251660] [2023-02-16 00:35:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:22,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:22,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:22,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:22,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 00:35:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:22,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:35:22,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:22,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:35:22,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:35:22,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695251660] [2023-02-16 00:35:22,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695251660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:35:22,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:35:22,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:35:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054484546] [2023-02-16 00:35:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:35:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:35:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:35:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:35:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:35:22,410 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:22,544 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-02-16 00:35:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:35:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 00:35:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:22,546 INFO L225 Difference]: With dead ends: 36 [2023-02-16 00:35:22,546 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 00:35:22,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:35:22,548 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:22,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:35:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 00:35:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-02-16 00:35:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-16 00:35:22,556 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2023-02-16 00:35:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:22,556 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-16 00:35:22,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-16 00:35:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:35:22,557 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:22,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:22,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-16 00:35:22,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:22,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2023-02-16 00:35:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:22,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321200404] [2023-02-16 00:35:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:22,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:22,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:22,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 00:35:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:22,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 00:35:22,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:23,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:23,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-02-16 00:35:23,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:35:23,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:23,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-02-16 00:35:23,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:23,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2023-02-16 00:35:23,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:23,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2023-02-16 00:35:23,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:23,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2023-02-16 00:35:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:23,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:28,803 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:29,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:35:29,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321200404] [2023-02-16 00:35:29,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321200404] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:29,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:29,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-02-16 00:35:29,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646444962] [2023-02-16 00:35:29,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:29,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 00:35:29,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:35:29,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 00:35:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:35:29,172 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:32,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-16 00:35:41,674 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:35:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:42,935 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-02-16 00:35:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 00:35:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 00:35:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:42,936 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:35:42,937 INFO L226 Difference]: Without dead ends: 36 [2023-02-16 00:35:42,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2023-02-16 00:35:42,938 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:42,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 53 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2023-02-16 00:35:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-16 00:35:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-02-16 00:35:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-16 00:35:42,949 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2023-02-16 00:35:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:42,949 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-16 00:35:42,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-16 00:35:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:35:42,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:42,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:42,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:43,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:43,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2023-02-16 00:35:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:43,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511925606] [2023-02-16 00:35:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:43,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:43,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 00:35:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:43,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 00:35:43,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:43,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:35:43,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:35:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:35:43,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:43,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-16 00:35:43,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-16 00:35:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:35:43,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:35:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511925606] [2023-02-16 00:35:43,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511925606] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:43,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:43,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-02-16 00:35:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573152107] [2023-02-16 00:35:43,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:43,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 00:35:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:35:43,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 00:35:43,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:35:43,363 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:45,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-16 00:35:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:45,506 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2023-02-16 00:35:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:35:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 00:35:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:45,508 INFO L225 Difference]: With dead ends: 45 [2023-02-16 00:35:45,508 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 00:35:45,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:35:45,509 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:45,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2023-02-16 00:35:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 00:35:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-16 00:35:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-16 00:35:45,516 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2023-02-16 00:35:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:45,516 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-16 00:35:45,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-16 00:35:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:35:45,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:45,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:45,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-16 00:35:45,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:45,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2023-02-16 00:35:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:45,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465452834] [2023-02-16 00:35:45,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:35:45,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:45,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:45,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:45,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 00:35:45,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:35:45,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:45,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 00:35:45,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:35:45,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:35:46,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:35:46,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465452834] [2023-02-16 00:35:46,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465452834] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:46,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:46,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-16 00:35:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353420069] [2023-02-16 00:35:46,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:46,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:35:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:35:46,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:35:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:35:46,081 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:46,561 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2023-02-16 00:35:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:35:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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 [2023-02-16 00:35:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:46,563 INFO L225 Difference]: With dead ends: 60 [2023-02-16 00:35:46,563 INFO L226 Difference]: Without dead ends: 40 [2023-02-16 00:35:46,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2023-02-16 00:35:46,564 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:46,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 25 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:35:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-16 00:35:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2023-02-16 00:35:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-16 00:35:46,572 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-02-16 00:35:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:46,572 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-16 00:35:46,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-16 00:35:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:35:46,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:46,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:46,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:46,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:46,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2023-02-16 00:35:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:46,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075797982] [2023-02-16 00:35:46,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:35:46,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:46,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:46,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 00:35:46,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:35:46,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:46,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 00:35:46,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:35:47,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:35:47,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:35:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075797982] [2023-02-16 00:35:47,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075797982] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:47,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:47,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-02-16 00:35:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911684214] [2023-02-16 00:35:47,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:47,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 00:35:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:35:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 00:35:47,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-02-16 00:35:47,252 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:47,987 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2023-02-16 00:35:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:35:47,988 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 00:35:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:47,988 INFO L225 Difference]: With dead ends: 72 [2023-02-16 00:35:47,989 INFO L226 Difference]: Without dead ends: 57 [2023-02-16 00:35:47,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2023-02-16 00:35:47,990 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 236 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:47,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 25 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:35:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-16 00:35:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2023-02-16 00:35:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2023-02-16 00:35:47,999 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2023-02-16 00:35:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:47,999 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2023-02-16 00:35:47,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2023-02-16 00:35:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:35:48,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:48,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:48,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-16 00:35:48,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:48,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2023-02-16 00:35:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:35:48,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062250501] [2023-02-16 00:35:48,210 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:35:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:35:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:35:48,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:35:48,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 00:35:48,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:35:48,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:48,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 00:35:48,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:48,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:48,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-02-16 00:35:48,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:35:48,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 00:35:48,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 00:35:48,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:48,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-16 00:35:48,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:48,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2023-02-16 00:35:49,159 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-16 00:35:49,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 70 [2023-02-16 00:35:49,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:49,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2023-02-16 00:35:49,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:49,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 83 [2023-02-16 00:35:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:49,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:36:29,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:36:29,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2023-02-16 00:36:40,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:36:40,822 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-16 00:36:40,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 546 treesize of output 1 [2023-02-16 00:36:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:36:40,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:36:40,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062250501] [2023-02-16 00:36:40,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062250501] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:36:40,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:36:40,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2023-02-16 00:36:40,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667536817] [2023-02-16 00:36:40,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:36:40,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-16 00:36:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:36:40,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-16 00:36:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1058, Unknown=17, NotChecked=0, Total=1260 [2023-02-16 00:36:40,826 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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) [2023-02-16 00:36:52,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:36:53,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:36:57,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:00,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:02,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-16 00:37:26,422 WARN L233 SmtUtils]: Spent 15.76s on a formula simplification. DAG size of input: 99 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:37:28,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:31,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse33 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse15 (bvadd (let ((.cse34 (bvadd .cse33 (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64)))))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34))) .cse33)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (bvadd |c_ULTIMATE.start_main_~#sum~0#1.offset| (_ bv4 32))) (.cse12 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32))))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse8 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (let ((.cse1 (select .cse11 .cse8)) (.cse0 (select .cse11 |ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (_ bv1 32) .cse0)) (not (= (_ bv1 32) .cse1)) (= (let ((.cse2 (let ((.cse10 (bvadd .cse0 (_ bv5 32)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse11 |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse8 (bvadd .cse1 (_ bv5 32)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (bvadd (concat (select .cse6 .cse7) (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) .cse10)))) (let ((.cse4 ((_ extract 31 0) .cse9)) (.cse3 ((_ extract 63 32) .cse9))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse7 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) .cse12))))) (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (not (bvsle c_~N~0 (_ bv0 32))) (let ((.cse13 (bvule c_~N~0 (_ bv536870911 32)))) (or (and (not .cse13) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse13))) (= (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|) ((_ extract 31 0) .cse15)) (= (select .cse14 .cse7) ((_ extract 63 32) .cse15)) (exists ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1.base| (_ BitVec 32))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse16 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv6 32)) (= (select .cse16 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (_ bv6 32))))) (bvslt (_ bv1 32) c_~N~0) (let ((.cse24 (bvadd (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (select .cse11 .cse24))) (or (= (let ((.cse17 (let ((.cse23 (store .cse11 .cse24 (bvadd .cse25 (_ bv5 32))))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (bvadd (concat (select .cse19 .cse7) (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse21 ((_ extract 63 32) .cse22)) (.cse20 ((_ extract 31 0) .cse22))) (bvadd ((_ sign_extend 32) (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse7 .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (concat .cse21 .cse20))))))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse12) (not (= (_ bv1 32) .cse25))))) (or (not (bvslt (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)) c_~N~0)) (forall ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse31 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (or (= (let ((.cse26 (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (bvadd .cse33 (concat (select .cse30 .cse7) (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse28 ((_ extract 31 0) .cse32)) (.cse27 ((_ extract 63 32) .cse32))) (bvadd (concat .cse27 .cse28) ((_ sign_extend 32) (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse7 .cse27)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse31))))))))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))) .cse12) (not (= (select v_arrayElimArr_1 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv6 32))) (not (= (_ bv6 32) (select v_arrayElimArr_1 .cse31)))))) (bvslt (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv2 32)) c_~N~0)) (not (bvslt (_ bv2 32) c_~N~0))))) is different from false [2023-02-16 00:37:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:34,105 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-02-16 00:37:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 00:37:34,106 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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) Word has length 27 [2023-02-16 00:37:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:34,106 INFO L225 Difference]: With dead ends: 63 [2023-02-16 00:37:34,106 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 00:37:34,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 86.7s TimeCoverageRelationStatistics Valid=489, Invalid=2688, Unknown=19, NotChecked=110, Total=3306 [2023-02-16 00:37:34,108 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 84 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 35 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:34,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 55 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 551 Invalid, 5 Unknown, 1 Unchecked, 17.3s Time] [2023-02-16 00:37:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 00:37:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2023-02-16 00:37:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-02-16 00:37:34,117 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2023-02-16 00:37:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:34,118 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-02-16 00:37:34,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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) [2023-02-16 00:37:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-02-16 00:37:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:37:34,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:34,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:37:34,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:37:34,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:37:34,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2023-02-16 00:37:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:37:34,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265548310] [2023-02-16 00:37:34,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:34,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:37:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:37:34,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:37:34,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 00:37:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:34,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 00:37:34,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:34,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 00:37:34,625 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-16 00:37:34,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-02-16 00:37:34,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-16 00:37:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:37:34,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:37:34,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-16 00:37:34,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-16 00:37:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:37:35,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:37:35,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265548310] [2023-02-16 00:37:35,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265548310] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:37:35,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:37:35,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-02-16 00:37:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259479911] [2023-02-16 00:37:35,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:37:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:37:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:37:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:37:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:37:35,035 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:35,719 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-02-16 00:37:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:37:35,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 00:37:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:35,721 INFO L225 Difference]: With dead ends: 69 [2023-02-16 00:37:35,721 INFO L226 Difference]: Without dead ends: 40 [2023-02-16 00:37:35,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:37:35,722 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:35,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 00:37:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-16 00:37:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-02-16 00:37:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-02-16 00:37:35,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2023-02-16 00:37:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:35,729 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-02-16 00:37:35,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-02-16 00:37:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:37:35,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:35,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:37:35,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 00:37:35,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:37:35,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2023-02-16 00:37:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:37:35,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422673428] [2023-02-16 00:37:35,934 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:37:35,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:37:35,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:37:35,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:37:35,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 00:37:36,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 00:37:36,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:37:36,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 00:37:36,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:37:37,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:37:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:37:38,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:37:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422673428] [2023-02-16 00:37:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422673428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:37:38,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:37:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-02-16 00:37:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939654224] [2023-02-16 00:37:38,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:37:38,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 00:37:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:37:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 00:37:38,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:37:38,100 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:41,065 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2023-02-16 00:37:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 00:37:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 00:37:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:41,066 INFO L225 Difference]: With dead ends: 88 [2023-02-16 00:37:41,066 INFO L226 Difference]: Without dead ends: 69 [2023-02-16 00:37:41,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2023-02-16 00:37:41,068 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 247 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:41,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 27 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 00:37:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-16 00:37:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2023-02-16 00:37:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-16 00:37:41,077 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2023-02-16 00:37:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:41,078 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-16 00:37:41,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-16 00:37:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:37:41,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:41,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:37:41,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 00:37:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:37:41,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2023-02-16 00:37:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:37:41,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709935908] [2023-02-16 00:37:41,290 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:37:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:37:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:37:41,291 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:37:41,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-16 00:37:41,443 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-16 00:37:41,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:37:41,448 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-16 00:37:41,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:41,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:37:41,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:41,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-02-16 00:37:41,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 00:37:41,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 00:37:42,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 00:37:42,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:37:42,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-16 00:37:43,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:37:43,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2023-02-16 00:37:43,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:37:43,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 61 [2023-02-16 00:37:44,585 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-16 00:37:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 82 [2023-02-16 00:37:45,121 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-16 00:37:45,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 140 treesize of output 108 [2023-02-16 00:37:45,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:37:45,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 113 [2023-02-16 00:37:46,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:37:46,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 212 treesize of output 142 [2023-02-16 00:37:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:37:46,225 INFO L328 TraceCheckSpWp]: Computing backward predicates...