./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/loops/eureka_05.i -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 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:43:33,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:43:33,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:43:33,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:43:33,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:43:33,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:43:33,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:43:33,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:43:33,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:43:33,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:43:33,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:43:33,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:43:33,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:43:33,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:43:33,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:43:33,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:43:33,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:43:33,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:43:33,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:43:33,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:43:33,287 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:43:33,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:43:33,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:43:33,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:43:33,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:43:33,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:43:33,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:43:33,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:43:33,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:43:33,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:43:33,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:43:33,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:43:33,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:43:33,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:43:33,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:43:33,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:43:33,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:43:33,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:43:33,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:43:33,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:43:33,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:43:33,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:43:33,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:43:33,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:43:33,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:43:33,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:43:33,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:43:33,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:43:33,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:43:33,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:43:33,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:43:33,350 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:43:33,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:43:33,352 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:43:33,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:43:33,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:43:33,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:43:33,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:43:33,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:43:33,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:43:33,353 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:43:33,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:43:33,355 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:43:33,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:43:33,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:43:33,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:43:33,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:43:33,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:43:33,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:43:33,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:43:33,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:43:33,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:43:33,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:43:33,357 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:43:33,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:43:33,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:43:33,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2022-07-12 03:43:33,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:43:33,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:43:33,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:43:33,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:43:33,658 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:43:33,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_05.i [2022-07-12 03:43:33,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1402e7bf/4f7c14e2e7fd41dba9019742fcd738b6/FLAG3dc0633ad [2022-07-12 03:43:34,162 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:43:34,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2022-07-12 03:43:34,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1402e7bf/4f7c14e2e7fd41dba9019742fcd738b6/FLAG3dc0633ad [2022-07-12 03:43:34,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1402e7bf/4f7c14e2e7fd41dba9019742fcd738b6 [2022-07-12 03:43:34,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:43:34,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:43:34,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:43:34,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:43:34,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:43:34,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e2c527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34, skipping insertion in model container [2022-07-12 03:43:34,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:43:34,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:43:34,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i[810,823] [2022-07-12 03:43:34,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:43:34,781 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:43:34,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i[810,823] [2022-07-12 03:43:34,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:43:34,831 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:43:34,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34 WrapperNode [2022-07-12 03:43:34,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:43:34,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:43:34,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:43:34,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:43:34,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,875 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-07-12 03:43:34,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:43:34,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:43:34,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:43:34,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:43:34,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:43:34,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:43:34,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:43:34,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:43:34,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (1/1) ... [2022-07-12 03:43:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:43:34,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:34,953 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) [2022-07-12 03:43:34,977 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 [2022-07-12 03:43:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:43:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:43:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:43:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:43:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:43:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:43:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:43:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:43:35,055 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:43:35,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:43:35,247 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:43:35,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:43:35,252 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 03:43:35,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:43:35 BoogieIcfgContainer [2022-07-12 03:43:35,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:43:35,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:43:35,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:43:35,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:43:35,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:43:34" (1/3) ... [2022-07-12 03:43:35,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcb952c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:43:35, skipping insertion in model container [2022-07-12 03:43:35,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:34" (2/3) ... [2022-07-12 03:43:35,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcb952c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:43:35, skipping insertion in model container [2022-07-12 03:43:35,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:43:35" (3/3) ... [2022-07-12 03:43:35,274 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2022-07-12 03:43:35,289 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:43:35,290 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:43:35,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:43:35,348 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a65359c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9d28d02 [2022-07-12 03:43:35,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:43:35,359 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) [2022-07-12 03:43:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:43:35,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:35,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:35,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2015864939, now seen corresponding path program 1 times [2022-07-12 03:43:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:35,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382773382] [2022-07-12 03:43:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:35,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382773382] [2022-07-12 03:43:35,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382773382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:43:35,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:43:35,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:43:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154468177] [2022-07-12 03:43:35,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:43:35,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:43:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:43:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:43:35,610 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:35,661 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-12 03:43:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:43:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-12 03:43:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:35,671 INFO L225 Difference]: With dead ends: 42 [2022-07-12 03:43:35,671 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 03:43:35,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:43:35,679 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:35,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:43:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 03:43:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-12 03:43:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-12 03:43:35,711 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-07-12 03:43:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:35,711 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-12 03:43:35,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-12 03:43:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:43:35,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:35,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:35,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:43:35,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1565230291, now seen corresponding path program 1 times [2022-07-12 03:43:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874458280] [2022-07-12 03:43:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:35,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874458280] [2022-07-12 03:43:35,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874458280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:35,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324195469] [2022-07-12 03:43:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:35,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:35,785 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) [2022-07-12 03:43:35,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:43:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:35,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:43:35,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:35,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:35,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324195469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:35,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:35,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-12 03:43:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662785676] [2022-07-12 03:43:35,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:35,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:43:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:43:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:43:35,912 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:35,977 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-12 03:43:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:43:35,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 03:43:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:35,978 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:43:35,978 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:43:35,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:43:35,980 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:35,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:43:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-07-12 03:43:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-12 03:43:35,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-07-12 03:43:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:35,986 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-12 03:43:35,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-12 03:43:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:43:35,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:35,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:36,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 03:43:36,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:36,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -7962739, now seen corresponding path program 2 times [2022-07-12 03:43:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:36,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868492259] [2022-07-12 03:43:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:43:36,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:36,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868492259] [2022-07-12 03:43:36,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868492259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:43:36,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:43:36,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:43:36,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106219651] [2022-07-12 03:43:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:43:36,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:43:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:36,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:43:36,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:43:36,275 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:36,299 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-07-12 03:43:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:43:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:43:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:36,300 INFO L225 Difference]: With dead ends: 38 [2022-07-12 03:43:36,300 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:43:36,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:43:36,302 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:36,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 30 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:43:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:43:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-07-12 03:43:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) [2022-07-12 03:43:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-12 03:43:36,308 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2022-07-12 03:43:36,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:36,309 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-12 03:43:36,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-12 03:43:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:43:36,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:36,310 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:36,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:43:36,310 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1148715813, now seen corresponding path program 1 times [2022-07-12 03:43:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:36,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913745794] [2022-07-12 03:43:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:43:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913745794] [2022-07-12 03:43:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913745794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:43:36,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:43:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:43:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422551492] [2022-07-12 03:43:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:43:36,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:43:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:43:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:43:36,440 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:36,496 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-07-12 03:43:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:43:36,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 03:43:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:36,499 INFO L225 Difference]: With dead ends: 47 [2022-07-12 03:43:36,499 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:43:36,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:43:36,501 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:36,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:43:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:43:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-07-12 03:43:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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) [2022-07-12 03:43:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-12 03:43:36,511 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-07-12 03:43:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:36,512 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-12 03:43:36,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-12 03:43:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:43:36,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:36,514 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:36,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:43:36,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1025080129, now seen corresponding path program 1 times [2022-07-12 03:43:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499610447] [2022-07-12 03:43:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 03:43:36,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:36,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499610447] [2022-07-12 03:43:36,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499610447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:36,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185149933] [2022-07-12 03:43:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:36,656 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) [2022-07-12 03:43:36,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:43:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:43:36,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:43:36,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:43:36,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185149933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:36,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:36,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2022-07-12 03:43:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337414880] [2022-07-12 03:43:36,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:36,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:43:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:36,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:43:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:43:36,862 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) [2022-07-12 03:43:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:36,993 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-07-12 03:43:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:43:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 24 [2022-07-12 03:43:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:36,995 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:43:36,995 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 03:43:36,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:43:36,997 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:36,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 109 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 03:43:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2022-07-12 03:43:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-12 03:43:37,004 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2022-07-12 03:43:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:37,005 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-12 03:43:37,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) [2022-07-12 03:43:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-12 03:43:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:43:37,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:37,006 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:37,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:43:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:37,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2070168231, now seen corresponding path program 2 times [2022-07-12 03:43:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:37,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936483462] [2022-07-12 03:43:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 03:43:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936483462] [2022-07-12 03:43:37,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936483462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640029453] [2022-07-12 03:43:37,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:43:37,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:37,318 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) [2022-07-12 03:43:37,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:43:37,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:43:37,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:37,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:43:37,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 03:43:37,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 03:43:37,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640029453] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:37,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:37,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-07-12 03:43:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523291576] [2022-07-12 03:43:37,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:43:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:43:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:43:37,546 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:37,758 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2022-07-12 03:43:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 03:43:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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 30 [2022-07-12 03:43:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:37,763 INFO L225 Difference]: With dead ends: 82 [2022-07-12 03:43:37,763 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 03:43:37,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2022-07-12 03:43:37,767 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 170 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:37,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 76 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 03:43:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2022-07-12 03:43:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-07-12 03:43:37,778 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 30 [2022-07-12 03:43:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:37,778 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-12 03:43:37,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-07-12 03:43:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 03:43:37,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:37,780 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:37,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:43:38,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:38,006 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash 271285953, now seen corresponding path program 3 times [2022-07-12 03:43:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:38,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686370512] [2022-07-12 03:43:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:38,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 03:43:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:38,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686370512] [2022-07-12 03:43:38,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686370512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:38,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443749408] [2022-07-12 03:43:38,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:43:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:38,152 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) [2022-07-12 03:43:38,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:43:38,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-12 03:43:38,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:38,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:43:38,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-12 03:43:38,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-12 03:43:38,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443749408] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:38,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:38,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2022-07-12 03:43:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538010823] [2022-07-12 03:43:38,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:38,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:43:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:43:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:43:38,363 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:38,561 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2022-07-12 03:43:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 03:43:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 58 [2022-07-12 03:43:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:38,563 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:43:38,570 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 03:43:38,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2022-07-12 03:43:38,572 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 107 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:38,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 56 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 03:43:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-12 03:43:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2022-07-12 03:43:38,595 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 58 [2022-07-12 03:43:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:38,597 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2022-07-12 03:43:38,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-07-12 03:43:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 03:43:38,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:38,604 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:38,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:43:38,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:38,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1550484977, now seen corresponding path program 4 times [2022-07-12 03:43:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:38,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328247378] [2022-07-12 03:43:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 33 proven. 123 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 03:43:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:38,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328247378] [2022-07-12 03:43:38,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328247378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:38,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119939967] [2022-07-12 03:43:38,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:43:38,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:38,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:38,955 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) [2022-07-12 03:43:38,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:43:39,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:43:39,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:39,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:43:39,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 03:43:39,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 03:43:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119939967] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:39,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 13 [2022-07-12 03:43:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774168121] [2022-07-12 03:43:39,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:43:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:43:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:43:39,234 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:39,563 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2022-07-12 03:43:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 03:43:39,565 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 66 [2022-07-12 03:43:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:39,566 INFO L225 Difference]: With dead ends: 137 [2022-07-12 03:43:39,566 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 03:43:39,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=804, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:43:39,568 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 108 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:39,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 111 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 03:43:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2022-07-12 03:43:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2022-07-12 03:43:39,593 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 66 [2022-07-12 03:43:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:39,594 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2022-07-12 03:43:39,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2022-07-12 03:43:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 03:43:39,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:39,598 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:39,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:43:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:39,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 96032675, now seen corresponding path program 5 times [2022-07-12 03:43:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:39,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062528058] [2022-07-12 03:43:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-12 03:43:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:40,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062528058] [2022-07-12 03:43:40,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062528058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:40,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113238032] [2022-07-12 03:43:40,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:43:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:40,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:40,205 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) [2022-07-12 03:43:40,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:43:40,316 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-12 03:43:40,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:40,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 03:43:40,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:40,422 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-12 03:43:40,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2022-07-12 03:43:40,716 INFO L356 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2022-07-12 03:43:40,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 42 [2022-07-12 03:43:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 162 proven. 39 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 03:43:41,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 164 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 03:43:42,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113238032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:42,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:42,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 18] total 49 [2022-07-12 03:43:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310466159] [2022-07-12 03:43:42,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:42,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 03:43:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 03:43:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2135, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 03:43:42,107 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:15,927 INFO L93 Difference]: Finished difference Result 480 states and 630 transitions. [2022-07-12 03:44:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-07-12 03:44:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 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 69 [2022-07-12 03:44:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:15,931 INFO L225 Difference]: With dead ends: 480 [2022-07-12 03:44:15,931 INFO L226 Difference]: Without dead ends: 433 [2022-07-12 03:44:15,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9221 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=4582, Invalid=26216, Unknown=2, NotChecked=0, Total=30800 [2022-07-12 03:44:15,942 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 350 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 770 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:15,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 207 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1082 Invalid, 0 Unknown, 770 Unchecked, 0.7s Time] [2022-07-12 03:44:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-12 03:44:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 218. [2022-07-12 03:44:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.336405529953917) internal successors, (290), 217 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2022-07-12 03:44:15,974 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 69 [2022-07-12 03:44:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:15,974 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2022-07-12 03:44:15,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2022-07-12 03:44:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 03:44:15,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:15,976 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:15,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:44:16,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:16,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1703731131, now seen corresponding path program 1 times [2022-07-12 03:44:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:16,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94403908] [2022-07-12 03:44:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 134 proven. 26 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 03:44:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:16,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94403908] [2022-07-12 03:44:16,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94403908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:16,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975738748] [2022-07-12 03:44:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:16,628 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) [2022-07-12 03:44:16,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:44:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:16,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 03:44:16,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:16,741 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:44:16,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:44:16,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 03:44:16,925 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-12 03:44:16,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 03:44:17,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:17,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:17,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:17,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:17,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-12 03:44:17,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:17,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) is different from false [2022-07-12 03:44:17,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_310 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_310)) |c_~#array~0.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) is different from false [2022-07-12 03:44:17,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_45| 1) |c_ULTIMATE.start_main_~i~1#1|)) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_310 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_310)) |c_~#array~0.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)))) is different from false [2022-07-12 03:44:17,613 INFO L356 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-07-12 03:44:17,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-12 03:44:17,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:44:17,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 03:44:17,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:44:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 221 trivial. 25 not checked. [2022-07-12 03:44:17,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975738748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:17,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:17,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-07-12 03:44:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468308262] [2022-07-12 03:44:17,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:17,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 03:44:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 03:44:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1014, Unknown=3, NotChecked=198, Total=1332 [2022-07-12 03:44:17,774 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:20,049 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select |c_#memory_int| |c_~#array~0.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4 .cse1)) .cse2) (= (select |c_#valid| 3) 1) (= |c_~#array~0.base| 3) (= (select .cse3 (+ |c_~#array~0.offset| 4)) 0) (= 2 .cse2) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_45| 1) |c_ULTIMATE.start_main_~i~1#1|)) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_310 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_310)) |c_~#array~0.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)))) (not (= |c_~#array~0.base| |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse3 (+ |c_~#array~0.offset| 8)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| .cse1)) |c_ULTIMATE.start_main_~i~1#1|))) is different from false [2022-07-12 03:44:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:21,510 INFO L93 Difference]: Finished difference Result 450 states and 596 transitions. [2022-07-12 03:44:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 03:44:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-07-12 03:44:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:21,511 INFO L225 Difference]: With dead ends: 450 [2022-07-12 03:44:21,512 INFO L226 Difference]: Without dead ends: 271 [2022-07-12 03:44:21,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=500, Invalid=3418, Unknown=4, NotChecked=500, Total=4422 [2022-07-12 03:44:21,514 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 167 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:21,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 483 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1012 Invalid, 0 Unknown, 191 Unchecked, 0.5s Time] [2022-07-12 03:44:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-12 03:44:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 238. [2022-07-12 03:44:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.3248945147679325) internal successors, (314), 237 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 314 transitions. [2022-07-12 03:44:21,546 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 314 transitions. Word has length 73 [2022-07-12 03:44:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:21,546 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 314 transitions. [2022-07-12 03:44:21,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 314 transitions. [2022-07-12 03:44:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 03:44:21,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:21,547 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:21,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:44:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:21,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -68174383, now seen corresponding path program 2 times [2022-07-12 03:44:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:21,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977231562] [2022-07-12 03:44:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 117 proven. 65 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 03:44:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977231562] [2022-07-12 03:44:22,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977231562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258540015] [2022-07-12 03:44:22,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:44:22,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:22,814 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) [2022-07-12 03:44:22,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:44:22,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:44:22,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:22,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:44:22,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:22,942 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:44:22,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:44:23,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 03:44:23,082 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-12 03:44:23,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 03:44:23,130 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-12 03:44:23,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 03:44:23,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:23,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:23,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:23,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:23,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:44:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-12 03:44:23,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:23,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)) 2)) is different from false [2022-07-12 03:44:23,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_374 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_374)) |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))) is different from false [2022-07-12 03:44:23,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_374 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_374)) |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_60| 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2022-07-12 03:44:23,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_372) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_374)) |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)) 2) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_60| 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2022-07-12 03:44:23,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_61| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_61| 1) |c_ULTIMATE.start_main_~i~1#1|)) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_61| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_372) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_374)) |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_60| 1) |v_ULTIMATE.start_main_~i~1#1_61|)))))) is different from false [2022-07-12 03:44:23,879 INFO L356 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-07-12 03:44:23,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 49 [2022-07-12 03:44:23,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:44:23,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 03:44:23,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:44:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 221 trivial. 30 not checked. [2022-07-12 03:44:24,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258540015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:24,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:24,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 15] total 46 [2022-07-12 03:44:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957931497] [2022-07-12 03:44:24,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:24,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 03:44:24,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 03:44:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1588, Unknown=5, NotChecked=420, Total=2162 [2022-07-12 03:44:24,043 INFO L87 Difference]: Start difference. First operand 238 states and 314 transitions. Second operand has 47 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 46 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:26,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (<= |c_~#array~0.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4 .cse1)) .cse2) (= (select |c_#valid| 3) 1) (= 3 .cse2) (= |c_~#array~0.base| 3) (= (+ |c_ULTIMATE.start_main_~i~1#1| 2) (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8 .cse1))) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~1#1_61| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_61| 1) |c_ULTIMATE.start_main_~i~1#1|)) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_61| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_372) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_374)) |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_60| 1) |v_ULTIMATE.start_main_~i~1#1_61|)))))) (<= 0 |c_~#array~0.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| .cse1)) |c_ULTIMATE.start_main_~i~1#1|))) is different from false [2022-07-12 03:44:37,808 WARN L233 SmtUtils]: Spent 11.51s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:44:39,810 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_~#array~0.offset| 0) (<= |c_ULTIMATE.start_main_~i~1#1| 1) (forall ((|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_374 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_374)) |c_~#array~0.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_60| 1) |c_ULTIMATE.start_main_~i~1#1|)))) (= |c_~#array~0.base| 3) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8))) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (<= 0 |c_~#array~0.offset|)) is different from false [2022-07-12 03:44:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:41,439 INFO L93 Difference]: Finished difference Result 431 states and 569 transitions. [2022-07-12 03:44:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 03:44:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 46 states have internal predecessors, (117), 0 states have call successors, (0), 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 77 [2022-07-12 03:44:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:41,441 INFO L225 Difference]: With dead ends: 431 [2022-07-12 03:44:41,441 INFO L226 Difference]: Without dead ends: 277 [2022-07-12 03:44:41,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=445, Invalid=5126, Unknown=7, NotChecked=1064, Total=6642 [2022-07-12 03:44:41,443 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 87 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:41,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 424 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 431 Invalid, 0 Unknown, 262 Unchecked, 0.3s Time] [2022-07-12 03:44:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-12 03:44:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2022-07-12 03:44:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 260 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 341 transitions. [2022-07-12 03:44:41,479 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 341 transitions. Word has length 77 [2022-07-12 03:44:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:41,479 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 341 transitions. [2022-07-12 03:44:41,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4893617021276597) internal successors, (117), 46 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 341 transitions. [2022-07-12 03:44:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 03:44:41,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:41,481 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:41,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:44:41,707 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,SelfDestructingSolverStorable10 [2022-07-12 03:44:41,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1295334807, now seen corresponding path program 3 times [2022-07-12 03:44:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155915596] [2022-07-12 03:44:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 55 proven. 168 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 03:44:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:42,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155915596] [2022-07-12 03:44:42,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155915596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:42,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163167357] [2022-07-12 03:44:42,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:44:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:42,928 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) [2022-07-12 03:44:42,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:44:43,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-12 03:44:43,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:43,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 03:44:43,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:43,160 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:44:43,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:44:43,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:44:43,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:44:43,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:44:43,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:44:43,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:44:43,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:43,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:44:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:43,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:44:43,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-07-12 03:44:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-07-12 03:44:43,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:43,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_439) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4))))) is different from false [2022-07-12 03:44:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 9 not checked. [2022-07-12 03:44:43,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163167357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:43,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:43,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 7, 7] total 35 [2022-07-12 03:44:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818093275] [2022-07-12 03:44:43,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:43,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 03:44:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:43,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 03:44:43,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1058, Unknown=1, NotChecked=66, Total=1260 [2022-07-12 03:44:43,590 INFO L87 Difference]: Start difference. First operand 261 states and 341 transitions. Second operand has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:44,710 INFO L93 Difference]: Finished difference Result 610 states and 809 transitions. [2022-07-12 03:44:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-12 03:44:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 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 81 [2022-07-12 03:44:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:44,712 INFO L225 Difference]: With dead ends: 610 [2022-07-12 03:44:44,712 INFO L226 Difference]: Without dead ends: 377 [2022-07-12 03:44:44,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=2732, Unknown=1, NotChecked=108, Total=3192 [2022-07-12 03:44:44,714 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 114 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:44,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 346 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 862 Invalid, 0 Unknown, 117 Unchecked, 0.5s Time] [2022-07-12 03:44:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-12 03:44:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 299. [2022-07-12 03:44:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.3154362416107384) internal successors, (392), 298 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 392 transitions. [2022-07-12 03:44:44,761 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 392 transitions. Word has length 81 [2022-07-12 03:44:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:44,762 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 392 transitions. [2022-07-12 03:44:44,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 392 transitions. [2022-07-12 03:44:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 03:44:44,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:44,763 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:44,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:44:44,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:44,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2084121367, now seen corresponding path program 4 times [2022-07-12 03:44:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:44,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589854073] [2022-07-12 03:44:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 03:44:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:45,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589854073] [2022-07-12 03:44:45,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589854073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:45,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650570414] [2022-07-12 03:44:45,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:44:45,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:45,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:45,650 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:44:45,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:44:45,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:44:45,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:45,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:44:45,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:46,169 INFO L356 Elim1Store]: treesize reduction 333, result has 15.7 percent of original size [2022-07-12 03:44:46,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 79 [2022-07-12 03:44:46,281 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:44:46,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-07-12 03:44:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-12 03:44:46,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:48,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_SelectionSort_~rh~0#1_96| Int)) (or (forall ((v_ArrVal_496 Int) (v_ArrVal_495 Int)) (let ((.cse1 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse0 (store (store (select |c_#memory_int| |c_~#array~0.base|) (+ .cse1 |c_~#array~0.offset|) v_ArrVal_496) (+ (* |v_ULTIMATE.start_SelectionSort_~rh~0#1_96| 4) |c_~#array~0.offset|) v_ArrVal_495))) (< (select .cse0 (+ .cse1 |c_~#array~0.offset| 8)) (select .cse0 (+ .cse1 |c_~#array~0.offset| 4)))))) (not (<= |c_ULTIMATE.start_SelectionSort_~i~0#1| |v_ULTIMATE.start_SelectionSort_~rh~0#1_96|)))) is different from false [2022-07-12 03:44:49,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_SelectionSort_~rh~0#1_96| Int) (v_ArrVal_496 Int) (v_ArrVal_495 Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse0 (store (store (select |c_#memory_int| |c_~#array~0.base|) (+ .cse1 |c_~#array~0.offset|) v_ArrVal_496) (+ (* |v_ULTIMATE.start_SelectionSort_~rh~0#1_96| 4) |c_~#array~0.offset|) v_ArrVal_495))) (< (select .cse0 (+ .cse1 |c_~#array~0.offset| 8)) (select .cse0 (+ .cse1 |c_~#array~0.offset| 4))))) (< |v_ULTIMATE.start_SelectionSort_~rh~0#1_96| (+ |c_ULTIMATE.start_SelectionSort_~i~0#1| 1)))) is different from false [2022-07-12 03:44:50,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_SelectionSort_~rh~0#1_96| Int) (v_ArrVal_496 Int) (v_ArrVal_495 Int)) (or (< |v_ULTIMATE.start_SelectionSort_~rh~0#1_96| (+ 2 |c_ULTIMATE.start_SelectionSort_~i~0#1|)) (let ((.cse1 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse0 (store (store (select |c_#memory_int| |c_~#array~0.base|) (+ .cse1 |c_~#array~0.offset|) v_ArrVal_496) (+ (* |v_ULTIMATE.start_SelectionSort_~rh~0#1_96| 4) |c_~#array~0.offset|) v_ArrVal_495))) (< (select .cse0 (+ .cse1 |c_~#array~0.offset| 8)) (select .cse0 (+ .cse1 |c_~#array~0.offset| 4))))))) is different from false [2022-07-12 03:44:52,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2022-07-12 03:44:53,022 INFO L356 Elim1Store]: treesize reduction 88, result has 49.1 percent of original size [2022-07-12 03:44:53,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 925 treesize of output 872 [2022-07-12 03:44:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 9 refuted. 0 times theorem prover too weak. 122 trivial. 21 not checked. [2022-07-12 03:44:53,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650570414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:53,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:53,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 45 [2022-07-12 03:44:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730274706] [2022-07-12 03:44:53,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:53,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 03:44:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 03:44:53,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1558, Unknown=3, NotChecked=246, Total=1980 [2022-07-12 03:44:53,199 INFO L87 Difference]: Start difference. First operand 299 states and 392 transitions. Second operand has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:59,771 INFO L93 Difference]: Finished difference Result 597 states and 796 transitions. [2022-07-12 03:44:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 03:44:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-07-12 03:44:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:59,773 INFO L225 Difference]: With dead ends: 597 [2022-07-12 03:44:59,773 INFO L226 Difference]: Without dead ends: 358 [2022-07-12 03:44:59,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=471, Invalid=3827, Unknown=4, NotChecked=390, Total=4692 [2022-07-12 03:44:59,775 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:59,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 267 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 503 Invalid, 0 Unknown, 456 Unchecked, 0.3s Time] [2022-07-12 03:44:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-12 03:44:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 347. [2022-07-12 03:44:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.3208092485549132) internal successors, (457), 346 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 457 transitions. [2022-07-12 03:44:59,842 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 457 transitions. Word has length 81 [2022-07-12 03:44:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:59,842 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 457 transitions. [2022-07-12 03:44:59,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 457 transitions. [2022-07-12 03:44:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 03:44:59,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:59,844 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:59,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 03:45:00,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 03:45:00,056 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:45:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:45:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1523421589, now seen corresponding path program 5 times [2022-07-12 03:45:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:45:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717660687] [2022-07-12 03:45:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:45:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:45:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:45:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-12 03:45:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:45:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717660687] [2022-07-12 03:45:00,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717660687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:45:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709068768] [2022-07-12 03:45:00,350 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:45:00,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:45:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:45:00,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:45:00,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 03:45:00,426 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-12 03:45:00,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:45:00,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 03:45:00,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:45:00,674 INFO L356 Elim1Store]: treesize reduction 204, result has 23.9 percent of original size [2022-07-12 03:45:00,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 78 [2022-07-12 03:45:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 143 proven. 46 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:45:01,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:47:27,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2022-07-12 03:47:28,066 INFO L356 Elim1Store]: treesize reduction 108, result has 36.1 percent of original size [2022-07-12 03:47:28,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1808 treesize of output 1648 [2022-07-12 03:47:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 43 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:47:28,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709068768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:47:28,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:47:28,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 22] total 49 [2022-07-12 03:47:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150511443] [2022-07-12 03:47:28,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:47:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 03:47:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:47:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 03:47:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2062, Unknown=67, NotChecked=0, Total=2352 [2022-07-12 03:47:28,729 INFO L87 Difference]: Start difference. First operand 347 states and 457 transitions. Second operand has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:47:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:47:42,639 INFO L93 Difference]: Finished difference Result 725 states and 972 transitions. [2022-07-12 03:47:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-12 03:47:42,640 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 0 states have call successors, (0), 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 81 [2022-07-12 03:47:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:47:42,642 INFO L225 Difference]: With dead ends: 725 [2022-07-12 03:47:42,642 INFO L226 Difference]: Without dead ends: 414 [2022-07-12 03:47:42,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 160.7s TimeCoverageRelationStatistics Valid=1049, Invalid=9799, Unknown=72, NotChecked=0, Total=10920 [2022-07-12 03:47:42,645 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 102 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:47:42,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 253 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 367 Invalid, 0 Unknown, 556 Unchecked, 0.3s Time] [2022-07-12 03:47:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-12 03:47:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 362. [2022-07-12 03:47:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.368421052631579) internal successors, (494), 361 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:47:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 494 transitions. [2022-07-12 03:47:42,702 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 494 transitions. Word has length 81 [2022-07-12 03:47:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:47:42,703 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 494 transitions. [2022-07-12 03:47:42,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:47:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 494 transitions. [2022-07-12 03:47:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 03:47:42,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:47:42,705 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:47:42,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:47:42,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 03:47:42,914 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:47:42,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:47:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1084123367, now seen corresponding path program 6 times [2022-07-12 03:47:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:47:42,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906093343] [2022-07-12 03:47:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:47:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:47:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:47:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-07-12 03:47:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:47:43,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906093343] [2022-07-12 03:47:43,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906093343] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:47:43,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392944848] [2022-07-12 03:47:43,325 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 03:47:43,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:47:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:47:43,328 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:47:43,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 03:47:43,654 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-07-12 03:47:43,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:47:43,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 03:47:43,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:47:43,689 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:47:43,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:47:43,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 03:47:43,792 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-12 03:47:43,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 03:47:43,838 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-12 03:47:43,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 03:47:43,919 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-12 03:47:43,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-07-12 03:47:44,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:47:44,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:47:44,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:47:44,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:47:44,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:47:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-12 03:47:44,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:47:44,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) is different from false [2022-07-12 03:47:44,646 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) (<= 0 |c_ULTIMATE.start_main_~i~1#1|)) is different from false [2022-07-12 03:47:44,653 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))))) is different from false [2022-07-12 03:47:44,662 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_617 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3))) is different from false [2022-07-12 03:47:46,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_617 Int) (v_ArrVal_615 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (not (<= |ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_615) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) is different from false [2022-07-12 03:47:46,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_617 Int) (v_ArrVal_615 Int) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_614) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_615) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (not (<= |v_ULTIMATE.start_main_~i~1#1_97| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) is different from false [2022-07-12 03:47:46,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_98| Int)) (or (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_617 Int) (v_ArrVal_615 Int) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_614) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_615) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (not (<= |v_ULTIMATE.start_main_~i~1#1_97| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_98| 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2022-07-12 03:47:46,841 INFO L356 Elim1Store]: treesize reduction 224, result has 29.1 percent of original size [2022-07-12 03:47:46,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 104 [2022-07-12 03:47:46,876 INFO L356 Elim1Store]: treesize reduction 46, result has 49.5 percent of original size [2022-07-12 03:47:46,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 119 [2022-07-12 03:47:46,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:47:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 221 trivial. 32 not checked. [2022-07-12 03:47:47,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392944848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:47:47,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:47:47,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 43 [2022-07-12 03:47:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556496497] [2022-07-12 03:47:47,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:47:47,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 03:47:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:47:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 03:47:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1201, Unknown=8, NotChecked=532, Total=1892 [2022-07-12 03:47:47,028 INFO L87 Difference]: Start difference. First operand 362 states and 494 transitions. Second operand has 44 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:47:49,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select |c_#memory_int| |c_~#array~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= .cse0 4) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4 .cse2)) .cse0) (= (select |c_#valid| 3) 1) (or (<= 1 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))))) (= (select .cse3 (+ 16 |c_~#array~0.offset|)) 0) (= |c_~#array~0.base| 3) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (not (= |c_~#array~0.base| |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse3 (+ |c_~#array~0.offset| 8)) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| .cse2)) |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_main_~i~1#1_98| Int)) (or (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_617 Int) (v_ArrVal_615 Int) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_614) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_615) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (not (<= |v_ULTIMATE.start_main_~i~1#1_97| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_98| 1) |c_ULTIMATE.start_main_~i~1#1|)))))) is different from false [2022-07-12 03:47:56,584 WARN L233 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 74 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:47:57,141 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (and (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (or (<= 1 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))))) (= (select .cse0 (+ 16 |c_~#array~0.offset|)) 0) (= |c_~#array~0.base| 3) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (not (= |c_~#array~0.base| |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse0 (+ |c_~#array~0.offset| 8)) 0) (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_617 Int) (v_ArrVal_615 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (not (<= |ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_615) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))))) is different from false [2022-07-12 03:47:57,726 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (and (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (= (select .cse0 (+ 16 |c_~#array~0.offset|)) 0) (= |c_~#array~0.base| 3) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (or (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) (<= 0 |c_ULTIMATE.start_main_~i~1#1|)) (not (= |c_~#array~0.base| |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse0 (+ |c_~#array~0.offset| 8)) 0) (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_617 Int) (v_ArrVal_615 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (not (<= |ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_615) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))))) is different from false [2022-07-12 03:48:04,685 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|)) (.cse1 (+ |c_ULTIMATE.start_SelectionSort_~lh~0#1| 1))) (and (= |c_ULTIMATE.start_SelectionSort_#t~mem4#1| (select .cse0 (+ (* |c_ULTIMATE.start_SelectionSort_~rh~0#1| 4) |c_~#array~0.offset|))) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= .cse1 |c_ULTIMATE.start_SelectionSort_~i~0#1|) (= (select .cse0 (+ 16 |c_~#array~0.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~1#1_95| Int)) (or (not (<= |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_95| 1))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_617 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_617)) |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3)) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (forall ((v_ArrVal_623 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_623) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) (not (= |c_~#array~0.base| |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse0 (+ |c_~#array~0.offset| 8)) 0) (= |c_ULTIMATE.start_SelectionSort_~lh~0#1| 0) (<= |c_ULTIMATE.start_SelectionSort_~i~0#1| .cse1))) is different from false