./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:23:31,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:23:31,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:23:31,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:23:31,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:23:31,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:23:31,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:23:31,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:23:31,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:23:31,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:23:31,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:23:31,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:23:31,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:23:31,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:23:31,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:23:31,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:23:31,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:23:31,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:23:31,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:23:31,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:23:31,400 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:23:31,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:23:31,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:23:31,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:23:31,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:23:31,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:23:31,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:23:31,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:23:31,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:23:31,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:23:31,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:23:31,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:23:31,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:23:31,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:23:31,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:23:31,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:23:31,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:23:31,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:23:31,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:23:31,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:23:31,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:23:31,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:23:31,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:23:31,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:23:31,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:23:31,446 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:23:31,446 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:23:31,447 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:23:31,447 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:23:31,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:23:31,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:23:31,448 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:23:31,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:23:31,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:23:31,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:23:31,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:23:31,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:23:31,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:23:31,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:23:31,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:23:31,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:23:31,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:23:31,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:23:31,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:23:31,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:23:31,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:23:31,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:23:31,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:23:31,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:23:31,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:23:31,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:23:31,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:23:31,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:23:31,453 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:23:31,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:23:31,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:23:31,453 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 -> a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 [2022-07-13 15:23:31,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:23:31,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:23:31,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:23:31,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:23:31,696 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:23:31,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-1.c [2022-07-13 15:23:31,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7c68619/42eba67689084ae8ab3ef3bb2f6653b3/FLAG1fb589fcf [2022-07-13 15:23:32,097 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:23:32,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2022-07-13 15:23:32,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7c68619/42eba67689084ae8ab3ef3bb2f6653b3/FLAG1fb589fcf [2022-07-13 15:23:32,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7c68619/42eba67689084ae8ab3ef3bb2f6653b3 [2022-07-13 15:23:32,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:23:32,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:23:32,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:23:32,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:23:32,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:23:32,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb2a8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32, skipping insertion in model container [2022-07-13 15:23:32,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:23:32,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:23:32,285 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_01-1.c[446,459] [2022-07-13 15:23:32,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:23:32,325 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:23:32,337 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_01-1.c[446,459] [2022-07-13 15:23:32,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:23:32,373 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:23:32,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32 WrapperNode [2022-07-13 15:23:32,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:23:32,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:23:32,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:23:32,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:23:32,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,421 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2022-07-13 15:23:32,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:23:32,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:23:32,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:23:32,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:23:32,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:23:32,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:23:32,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:23:32,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:23:32,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (1/1) ... [2022-07-13 15:23:32,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:23:32,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:32,490 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-13 15:23:32,499 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-13 15:23:32,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:23:32,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:23:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:23:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:23:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:23:32,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:23:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:23:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:23:32,575 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:23:32,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:23:32,800 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:23:32,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:23:32,804 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 15:23:32,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:23:32 BoogieIcfgContainer [2022-07-13 15:23:32,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:23:32,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:23:32,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:23:32,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:23:32,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:23:32" (1/3) ... [2022-07-13 15:23:32,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae5bb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:23:32, skipping insertion in model container [2022-07-13 15:23:32,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:23:32" (2/3) ... [2022-07-13 15:23:32,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae5bb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:23:32, skipping insertion in model container [2022-07-13 15:23:32,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:23:32" (3/3) ... [2022-07-13 15:23:32,811 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2022-07-13 15:23:32,826 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:23:32,826 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:23:32,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:23:32,880 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@1045cfa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76d2f8e1 [2022-07-13 15:23:32,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:23:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:23:32,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:32,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:32,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2022-07-13 15:23:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:32,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429469419] [2022-07-13 15:23:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:33,130 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-13 15:23:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:33,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429469419] [2022-07-13 15:23:33,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429469419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:23:33,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:23:33,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:23:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199849525] [2022-07-13 15:23:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:23:33,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:23:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:33,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:23:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:23:33,160 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:33,250 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2022-07-13 15:23:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:23:33,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:23:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:33,259 INFO L225 Difference]: With dead ends: 89 [2022-07-13 15:23:33,259 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 15:23:33,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:23:33,264 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:33,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:23:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 15:23:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-07-13 15:23:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-13 15:23:33,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-07-13 15:23:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:33,286 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 15:23:33,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-13 15:23:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:23:33,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:33,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:33,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:23:33,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2022-07-13 15:23:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:33,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666530225] [2022-07-13 15:23:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:33,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666530225] [2022-07-13 15:23:33,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666530225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:33,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293273625] [2022-07-13 15:23:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:33,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:33,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:33,504 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-13 15:23:33,506 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-13 15:23:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:33,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:23:33,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:33,687 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 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 15:23:33,769 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 15 treesize of output 7 [2022-07-13 15:23:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:33,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:33,834 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 14 treesize of output 12 [2022-07-13 15:23:33,837 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 26 treesize of output 24 [2022-07-13 15:23:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:33,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293273625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:33,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:33,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-13 15:23:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687000724] [2022-07-13 15:23:33,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:33,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 15:23:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 15:23:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:23:33,856 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 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-13 15:23:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:34,035 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-07-13 15:23:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:23:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:23:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:34,036 INFO L225 Difference]: With dead ends: 84 [2022-07-13 15:23:34,036 INFO L226 Difference]: Without dead ends: 82 [2022-07-13 15:23:34,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 15:23:34,038 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 75 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:34,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:23:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-13 15:23:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2022-07-13 15:23:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 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-13 15:23:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-07-13 15:23:34,044 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2022-07-13 15:23:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:34,044 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2022-07-13 15:23:34,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 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-13 15:23:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-07-13 15:23:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:23:34,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:34,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:34,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:23:34,255 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-13 15:23:34,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2022-07-13 15:23:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:34,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083373719] [2022-07-13 15:23:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:34,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:34,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083373719] [2022-07-13 15:23:34,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083373719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:23:34,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:23:34,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:23:34,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492357767] [2022-07-13 15:23:34,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:23:34,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:23:34,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:34,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:23:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:23:34,292 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:34,312 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-07-13 15:23:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:23:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:23:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:34,313 INFO L225 Difference]: With dead ends: 66 [2022-07-13 15:23:34,313 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 15:23:34,313 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-13 15:23:34,314 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:34,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:23:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 15:23:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-07-13 15:23:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-07-13 15:23:34,318 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2022-07-13 15:23:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:34,318 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-07-13 15:23:34,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-07-13 15:23:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:23:34,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:34,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:34,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:23:34,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2022-07-13 15:23:34,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:34,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253688644] [2022-07-13 15:23:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253688644] [2022-07-13 15:23:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253688644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926799628] [2022-07-13 15:23:34,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:34,381 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-13 15:23:34,383 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-13 15:23:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:34,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:23:34,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:34,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926799628] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:34,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-13 15:23:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218741752] [2022-07-13 15:23:34,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:34,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:23:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:23:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:23:34,498 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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-13 15:23:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:34,583 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-07-13 15:23:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:23:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 15:23:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:34,585 INFO L225 Difference]: With dead ends: 114 [2022-07-13 15:23:34,585 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 15:23:34,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:23:34,586 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:34,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:23:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 15:23:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2022-07-13 15:23:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 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-13 15:23:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-07-13 15:23:34,592 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2022-07-13 15:23:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:34,592 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-07-13 15:23:34,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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-13 15:23:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-07-13 15:23:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:23:34,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:34,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:34,622 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-13 15:23:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 15:23:34,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2022-07-13 15:23:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232778717] [2022-07-13 15:23:34,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:23:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232778717] [2022-07-13 15:23:34,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232778717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120400031] [2022-07-13 15:23:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:34,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:34,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:34,880 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-13 15:23:34,881 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-13 15:23:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:34,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 15:23:34,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:23:34,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:23:34,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120400031] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:34,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:34,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 15:23:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534926399] [2022-07-13 15:23:34,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:34,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 15:23:34,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:34,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 15:23:34,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:23:34,999 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:35,142 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2022-07-13 15:23:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:23:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 15:23:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:35,143 INFO L225 Difference]: With dead ends: 181 [2022-07-13 15:23:35,143 INFO L226 Difference]: Without dead ends: 159 [2022-07-13 15:23:35,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:23:35,144 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 164 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:35,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 155 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:23:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-13 15:23:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2022-07-13 15:23:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-07-13 15:23:35,152 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2022-07-13 15:23:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:35,152 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-07-13 15:23:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-07-13 15:23:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:23:35,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:35,153 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:35,169 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-13 15:23:35,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:35,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2022-07-13 15:23:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:35,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545226586] [2022-07-13 15:23:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:35,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:35,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545226586] [2022-07-13 15:23:35,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545226586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:35,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257192922] [2022-07-13 15:23:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:35,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:35,419 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-13 15:23:35,420 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-13 15:23:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:35,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 15:23:35,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:35,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:35,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257192922] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:35,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:35,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 15:23:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162096419] [2022-07-13 15:23:35,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:35,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 15:23:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:35,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 15:23:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:23:35,565 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:35,652 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2022-07-13 15:23:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:23:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-13 15:23:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:35,653 INFO L225 Difference]: With dead ends: 206 [2022-07-13 15:23:35,654 INFO L226 Difference]: Without dead ends: 146 [2022-07-13 15:23:35,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:23:35,656 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:35,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:23:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-13 15:23:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2022-07-13 15:23:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 0 states have call successors, (0), 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-13 15:23:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2022-07-13 15:23:35,676 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2022-07-13 15:23:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:35,676 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2022-07-13 15:23:35,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2022-07-13 15:23:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:23:35,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:35,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:35,694 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-13 15:23:35,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:35,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2022-07-13 15:23:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:35,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667862376] [2022-07-13 15:23:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:36,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667862376] [2022-07-13 15:23:36,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667862376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:36,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524756937] [2022-07-13 15:23:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:36,186 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-13 15:23:36,187 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-13 15:23:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:36,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:23:36,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:36,285 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 54 treesize of output 50 [2022-07-13 15:23:36,316 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 19 treesize of output 18 [2022-07-13 15:23:36,416 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:23:36,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-13 15:23:36,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:23:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:36,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:38,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |v_ULTIMATE.start_main_~x~0#1_11|)) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-13 15:23:38,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2022-07-13 15:23:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-13 15:23:44,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524756937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:44,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:44,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2022-07-13 15:23:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574646704] [2022-07-13 15:23:44,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:44,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 15:23:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 15:23:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=367, Unknown=5, NotChecked=82, Total=552 [2022-07-13 15:23:44,361 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:44,667 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-13 15:23:44,949 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-13 15:23:46,959 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |v_ULTIMATE.start_main_~x~0#1_11|)) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1)) is different from false [2022-07-13 15:23:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:47,063 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-07-13 15:23:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:23:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 15:23:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:47,064 INFO L225 Difference]: With dead ends: 112 [2022-07-13 15:23:47,064 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 15:23:47,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=141, Invalid=521, Unknown=8, NotChecked=260, Total=930 [2022-07-13 15:23:47,065 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:47,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 200 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2022-07-13 15:23:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 15:23:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-13 15:23:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 15:23:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2022-07-13 15:23:47,072 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 25 [2022-07-13 15:23:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:47,072 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2022-07-13 15:23:47,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2022-07-13 15:23:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:23:47,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:47,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:47,090 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-13 15:23:47,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:47,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2022-07-13 15:23:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:47,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786155365] [2022-07-13 15:23:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:23:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:47,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786155365] [2022-07-13 15:23:47,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786155365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:47,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122334925] [2022-07-13 15:23:47,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:23:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:47,355 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-13 15:23:47,356 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-13 15:23:47,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:23:47,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:23:47,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 15:23:47,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:47,432 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 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 15:23:47,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:23:47,478 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 30 treesize of output 29 [2022-07-13 15:23:47,546 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 15 treesize of output 7 [2022-07-13 15:23:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:23:47,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:49,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-13 15:23:49,639 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 21 treesize of output 19 [2022-07-13 15:23:49,642 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 68 treesize of output 66 [2022-07-13 15:23:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-07-13 15:23:49,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122334925] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:49,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:49,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-07-13 15:23:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214021724] [2022-07-13 15:23:49,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:23:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:23:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2022-07-13 15:23:49,670 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 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-13 15:23:51,687 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= .cse0 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) .cse0) 0))) is different from false [2022-07-13 15:23:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:51,875 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-07-13 15:23:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:23:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 15:23:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:51,877 INFO L225 Difference]: With dead ends: 145 [2022-07-13 15:23:51,877 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 15:23:51,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=113, Invalid=313, Unknown=2, NotChecked=78, Total=506 [2022-07-13 15:23:51,878 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:51,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 172 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 242 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2022-07-13 15:23:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 15:23:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2022-07-13 15:23:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-07-13 15:23:51,885 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 25 [2022-07-13 15:23:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:51,886 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-07-13 15:23:51,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 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-13 15:23:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-07-13 15:23:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:23:51,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:51,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:51,911 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-13 15:23:52,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:52,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2022-07-13 15:23:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:52,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998782318] [2022-07-13 15:23:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:52,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998782318] [2022-07-13 15:23:52,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998782318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:52,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724602798] [2022-07-13 15:23:52,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:23:52,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:52,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:52,158 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-13 15:23:52,159 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-13 15:23:52,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:23:52,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:23:52,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 15:23:52,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:52,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:23:52,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724602798] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:52,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:52,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 15:23:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775840941] [2022-07-13 15:23:52,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:52,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 15:23:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 15:23:52,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:23:52,305 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-13 15:23:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:52,424 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2022-07-13 15:23:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:23:52,424 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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 28 [2022-07-13 15:23:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:52,425 INFO L225 Difference]: With dead ends: 183 [2022-07-13 15:23:52,425 INFO L226 Difference]: Without dead ends: 170 [2022-07-13 15:23:52,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-07-13 15:23:52,426 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 122 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:52,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 178 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:23:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-13 15:23:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2022-07-13 15:23:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-07-13 15:23:52,435 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2022-07-13 15:23:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:52,435 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-07-13 15:23:52,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-13 15:23:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-07-13 15:23:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:23:52,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:52,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:52,457 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-13 15:23:52,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:52,657 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 160714710, now seen corresponding path program 2 times [2022-07-13 15:23:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:52,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097626750] [2022-07-13 15:23:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:23:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:52,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097626750] [2022-07-13 15:23:52,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097626750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461747072] [2022-07-13 15:23:52,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:23:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:52,685 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-13 15:23:52,686 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-13 15:23:52,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:23:52,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:23:52,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:23:52,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:23:52,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:23:52,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461747072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:23:52,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:23:52,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-13 15:23:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125361252] [2022-07-13 15:23:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:23:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:23:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:23:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:23:52,773 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:52,809 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-07-13 15:23:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:23:52,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 15:23:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:52,810 INFO L225 Difference]: With dead ends: 213 [2022-07-13 15:23:52,810 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 15:23:52,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:23:52,811 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:52,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:23:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 15:23:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2022-07-13 15:23:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 0 states have call successors, (0), 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-13 15:23:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2022-07-13 15:23:52,820 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 29 [2022-07-13 15:23:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:52,820 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2022-07-13 15:23:52,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-07-13 15:23:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:23:52,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:52,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:52,839 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-13 15:23:53,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 15:23:53,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2022-07-13 15:23:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:53,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068192261] [2022-07-13 15:23:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:23:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:53,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068192261] [2022-07-13 15:23:53,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068192261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:53,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102583399] [2022-07-13 15:23:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:53,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:53,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:53,158 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-13 15:23:53,159 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-13 15:23:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:53,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 15:23:53,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:53,251 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:23:53,307 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 19 treesize of output 7 [2022-07-13 15:23:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:23:53,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:53,375 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 16 treesize of output 14 [2022-07-13 15:23:53,377 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 32 treesize of output 28 [2022-07-13 15:23:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:23:53,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102583399] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:23:53,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:23:53,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-07-13 15:23:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349358378] [2022-07-13 15:23:53,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:23:53,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 15:23:53,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:23:53,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 15:23:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-13 15:23:53,432 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 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-13 15:23:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:23:53,635 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2022-07-13 15:23:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 15:23:53,636 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 15:23:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:23:53,637 INFO L225 Difference]: With dead ends: 200 [2022-07-13 15:23:53,637 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 15:23:53,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-07-13 15:23:53,638 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:23:53,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 255 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 246 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2022-07-13 15:23:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 15:23:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 164. [2022-07-13 15:23:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 163 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:23:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 210 transitions. [2022-07-13 15:23:53,649 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 210 transitions. Word has length 29 [2022-07-13 15:23:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:23:53,650 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 210 transitions. [2022-07-13 15:23:53,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 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-13 15:23:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 210 transitions. [2022-07-13 15:23:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 15:23:53,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:23:53,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:23:53,685 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-13 15:23:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:53,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:23:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:23:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2022-07-13 15:23:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:23:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180100867] [2022-07-13 15:23:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:23:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:23:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:23:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:23:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:23:54,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180100867] [2022-07-13 15:23:54,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180100867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:23:54,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444258757] [2022-07-13 15:23:54,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:23:54,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:23:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:23:54,482 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-13 15:23:54,485 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-13 15:23:54,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:23:54,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:23:54,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 15:23:54,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:23:54,589 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 66 treesize of output 64 [2022-07-13 15:23:54,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:23:54,649 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-13 15:23:54,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 44 [2022-07-13 15:23:54,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:23:54,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:23:54,769 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:23:54,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-13 15:23:54,870 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-13 15:23:54,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2022-07-13 15:23:55,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-13 15:23:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:23:55,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:23:58,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_416 Int) (v_ArrVal_414 Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_33| (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |c_ULTIMATE.start_main_~x~0#1| 4)) v_ArrVal_414))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_416)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2022-07-13 15:24:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 15:24:24,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444258757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:24,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:24,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 46 [2022-07-13 15:24:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945174321] [2022-07-13 15:24:24,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:24,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 15:24:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 15:24:24,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1613, Unknown=15, NotChecked=86, Total=2070 [2022-07-13 15:24:24,339 INFO L87 Difference]: Start difference. First operand 164 states and 210 transitions. Second operand has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 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-13 15:24:24,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= (select .cse1 0) 0) (forall ((|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_416 Int) (v_ArrVal_414 Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_33| (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (<= 0 (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |c_ULTIMATE.start_main_~x~0#1| 4)) v_ArrVal_414))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_416)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (not (= (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |c_ULTIMATE.start_main_~x~0#1| 4)) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= |c_ULTIMATE.start_main_~x~0#1| .cse3) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= .cse3 1)))) is different from false [2022-07-13 15:24:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:26,653 INFO L93 Difference]: Finished difference Result 326 states and 412 transitions. [2022-07-13 15:24:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-13 15:24:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 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 31 [2022-07-13 15:24:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:26,654 INFO L225 Difference]: With dead ends: 326 [2022-07-13 15:24:26,655 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 15:24:26,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=868, Invalid=3679, Unknown=17, NotChecked=266, Total=4830 [2022-07-13 15:24:26,656 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:26,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 315 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 256 Invalid, 0 Unknown, 297 Unchecked, 0.1s Time] [2022-07-13 15:24:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 15:24:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 186. [2022-07-13 15:24:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 0 states have call successors, (0), 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-13 15:24:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2022-07-13 15:24:26,672 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 31 [2022-07-13 15:24:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:26,672 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2022-07-13 15:24:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 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-13 15:24:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-07-13 15:24:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 15:24:26,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:26,673 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:26,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:24:26,889 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,SelfDestructingSolverStorable11 [2022-07-13 15:24:26,889 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2058421380, now seen corresponding path program 1 times [2022-07-13 15:24:26,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:26,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819406411] [2022-07-13 15:24:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:24:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819406411] [2022-07-13 15:24:27,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819406411] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075620961] [2022-07-13 15:24:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:27,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:27,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:27,145 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-13 15:24:27,145 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-13 15:24:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:27,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:24:27,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:27,242 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 34 treesize of output 32 [2022-07-13 15:24:27,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 21 treesize of output 20 [2022-07-13 15:24:27,391 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:24:27,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-13 15:24:29,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-07-13 15:24:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:24:29,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:24:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:24:29,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075620961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:29,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:29,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2022-07-13 15:24:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668896796] [2022-07-13 15:24:29,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:29,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 15:24:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 15:24:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=632, Unknown=1, NotChecked=0, Total=756 [2022-07-13 15:24:29,735 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 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-13 15:24:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:30,086 INFO L93 Difference]: Finished difference Result 211 states and 269 transitions. [2022-07-13 15:24:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:24:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 15:24:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:30,088 INFO L225 Difference]: With dead ends: 211 [2022-07-13 15:24:30,088 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 15:24:30,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=267, Invalid=1064, Unknown=1, NotChecked=0, Total=1332 [2022-07-13 15:24:30,089 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 94 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:30,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 261 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 121 Invalid, 0 Unknown, 132 Unchecked, 0.1s Time] [2022-07-13 15:24:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 15:24:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2022-07-13 15:24:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.303191489361702) internal successors, (245), 188 states have internal predecessors, (245), 0 states have call successors, (0), 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-13 15:24:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2022-07-13 15:24:30,103 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 31 [2022-07-13 15:24:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:30,103 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2022-07-13 15:24:30,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 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-13 15:24:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2022-07-13 15:24:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 15:24:30,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:30,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:30,121 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-13 15:24:30,304 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,SelfDestructingSolverStorable12 [2022-07-13 15:24:30,305 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2022-07-13 15:24:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:30,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960011324] [2022-07-13 15:24:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:24:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960011324] [2022-07-13 15:24:30,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960011324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:24:30,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:24:30,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:24:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262357376] [2022-07-13 15:24:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:24:30,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:24:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:30,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:24:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:24:30,345 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 15:24:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:30,372 INFO L93 Difference]: Finished difference Result 308 states and 396 transitions. [2022-07-13 15:24:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:24:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 15:24:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:30,373 INFO L225 Difference]: With dead ends: 308 [2022-07-13 15:24:30,373 INFO L226 Difference]: Without dead ends: 214 [2022-07-13 15:24:30,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:24:30,374 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:30,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:24:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-13 15:24:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2022-07-13 15:24:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 188 states have internal predecessors, (243), 0 states have call successors, (0), 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-13 15:24:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 243 transitions. [2022-07-13 15:24:30,395 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 243 transitions. Word has length 31 [2022-07-13 15:24:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:30,395 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 243 transitions. [2022-07-13 15:24:30,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-13 15:24:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2022-07-13 15:24:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:24:30,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:30,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:30,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:24:30,396 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1438437486, now seen corresponding path program 2 times [2022-07-13 15:24:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:30,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661583161] [2022-07-13 15:24:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:24:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:30,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661583161] [2022-07-13 15:24:30,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661583161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:30,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875702394] [2022-07-13 15:24:30,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:24:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:30,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:30,450 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-13 15:24:30,451 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-13 15:24:30,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:24:30,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:24:30,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:24:30,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:24:30,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:24:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:24:30,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875702394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:30,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:30,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 15:24:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5831236] [2022-07-13 15:24:30,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:30,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:24:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:24:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:24:30,599 INFO L87 Difference]: Start difference. First operand 189 states and 243 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:24:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:30,844 INFO L93 Difference]: Finished difference Result 467 states and 590 transitions. [2022-07-13 15:24:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:24:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 15:24:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:30,854 INFO L225 Difference]: With dead ends: 467 [2022-07-13 15:24:30,854 INFO L226 Difference]: Without dead ends: 433 [2022-07-13 15:24:30,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 15:24:30,857 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 182 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:30,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 337 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:24:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-13 15:24:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 223. [2022-07-13 15:24:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2972972972972974) internal successors, (288), 222 states have internal predecessors, (288), 0 states have call successors, (0), 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-13 15:24:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 288 transitions. [2022-07-13 15:24:30,881 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 288 transitions. Word has length 32 [2022-07-13 15:24:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:30,882 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 288 transitions. [2022-07-13 15:24:30,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:24:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 288 transitions. [2022-07-13 15:24:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:24:30,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:30,883 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:30,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:24:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 15:24:31,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 3 times [2022-07-13 15:24:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:31,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983894598] [2022-07-13 15:24:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:24:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:31,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983894598] [2022-07-13 15:24:31,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983894598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:31,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933362257] [2022-07-13 15:24:31,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:24:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:31,154 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:24:31,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 15:24:31,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:24:31,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:24:31,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:24:31,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:24:31,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:24:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:24:31,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933362257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:31,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:31,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 15:24:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447096217] [2022-07-13 15:24:31,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:31,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:24:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:31,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:24:31,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:24:31,320 INFO L87 Difference]: Start difference. First operand 223 states and 288 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 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-13 15:24:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:31,500 INFO L93 Difference]: Finished difference Result 497 states and 630 transitions. [2022-07-13 15:24:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 15:24:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-13 15:24:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:31,502 INFO L225 Difference]: With dead ends: 497 [2022-07-13 15:24:31,502 INFO L226 Difference]: Without dead ends: 364 [2022-07-13 15:24:31,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-07-13 15:24:31,503 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 207 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:31,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 183 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:24:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-13 15:24:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 256. [2022-07-13 15:24:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 255 states have internal predecessors, (328), 0 states have call successors, (0), 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-13 15:24:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 328 transitions. [2022-07-13 15:24:31,532 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 328 transitions. Word has length 33 [2022-07-13 15:24:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:31,532 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 328 transitions. [2022-07-13 15:24:31,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 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-13 15:24:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 328 transitions. [2022-07-13 15:24:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 15:24:31,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:31,533 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:31,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 15:24:31,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 15:24:31,739 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2022-07-13 15:24:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:31,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149344286] [2022-07-13 15:24:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:24:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149344286] [2022-07-13 15:24:31,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149344286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117018156] [2022-07-13 15:24:31,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:24:31,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:31,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:31,798 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:24:31,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 15:24:31,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:24:31,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:24:31,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:24:31,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:24:31,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:24:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:24:31,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117018156] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:31,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:31,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 15:24:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534602517] [2022-07-13 15:24:31,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:31,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:24:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:24:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:24:31,953 INFO L87 Difference]: Start difference. First operand 256 states and 328 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 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-13 15:24:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:32,165 INFO L93 Difference]: Finished difference Result 547 states and 686 transitions. [2022-07-13 15:24:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:24:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 15:24:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:32,167 INFO L225 Difference]: With dead ends: 547 [2022-07-13 15:24:32,167 INFO L226 Difference]: Without dead ends: 526 [2022-07-13 15:24:32,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2022-07-13 15:24:32,168 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 135 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:32,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 302 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:24:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-13 15:24:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 353. [2022-07-13 15:24:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.3068181818181819) internal successors, (460), 352 states have internal predecessors, (460), 0 states have call successors, (0), 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-13 15:24:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 460 transitions. [2022-07-13 15:24:32,196 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 460 transitions. Word has length 34 [2022-07-13 15:24:32,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:32,196 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 460 transitions. [2022-07-13 15:24:32,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 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-13 15:24:32,196 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 460 transitions. [2022-07-13 15:24:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 15:24:32,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:32,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:32,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 15:24:32,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:32,411 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2022-07-13 15:24:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:32,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172441812] [2022-07-13 15:24:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:24:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:32,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172441812] [2022-07-13 15:24:32,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172441812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:32,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980466039] [2022-07-13 15:24:32,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:24:32,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:32,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:32,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:24:32,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 15:24:33,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:24:33,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:24:33,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 15:24:33,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:33,058 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 108 treesize of output 100 [2022-07-13 15:24:33,078 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 22 [2022-07-13 15:24:33,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:33,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 15:24:33,229 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:24:33,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-13 15:24:33,290 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:24:33,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-13 15:24:33,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:24:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:24:33,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:24:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:24:44,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980466039] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:44,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:44,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 14] total 35 [2022-07-13 15:24:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58240926] [2022-07-13 15:24:44,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:44,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-13 15:24:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-13 15:24:44,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=974, Unknown=9, NotChecked=0, Total=1190 [2022-07-13 15:24:44,960 INFO L87 Difference]: Start difference. First operand 353 states and 460 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 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-13 15:24:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:45,850 INFO L93 Difference]: Finished difference Result 805 states and 1024 transitions. [2022-07-13 15:24:45,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 15:24:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 15:24:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:45,853 INFO L225 Difference]: With dead ends: 805 [2022-07-13 15:24:45,853 INFO L226 Difference]: Without dead ends: 787 [2022-07-13 15:24:45,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=700, Invalid=2597, Unknown=9, NotChecked=0, Total=3306 [2022-07-13 15:24:45,854 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 358 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:45,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 418 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 323 Invalid, 0 Unknown, 464 Unchecked, 0.2s Time] [2022-07-13 15:24:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-07-13 15:24:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 432. [2022-07-13 15:24:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.3387470997679813) internal successors, (577), 431 states have internal predecessors, (577), 0 states have call successors, (0), 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-13 15:24:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 577 transitions. [2022-07-13 15:24:45,910 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 577 transitions. Word has length 34 [2022-07-13 15:24:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 577 transitions. [2022-07-13 15:24:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 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-13 15:24:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 577 transitions. [2022-07-13 15:24:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:24:45,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:45,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:45,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 15:24:46,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 15:24:46,128 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2122200076, now seen corresponding path program 4 times [2022-07-13 15:24:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:46,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128969071] [2022-07-13 15:24:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:24:46,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:46,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128969071] [2022-07-13 15:24:46,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128969071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:46,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674494612] [2022-07-13 15:24:46,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:24:46,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:46,262 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:24:46,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 15:24:46,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:24:46,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:24:46,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 15:24:46,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:46,352 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 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 15:24:46,383 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-13 15:24:46,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-13 15:24:46,684 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-13 15:24:46,684 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 22 treesize of output 10 [2022-07-13 15:24:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:24:46,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:24:47,026 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 16 treesize of output 14 [2022-07-13 15:24:47,028 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 32 treesize of output 28 [2022-07-13 15:24:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:24:47,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674494612] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:24:47,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:24:47,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 17] total 39 [2022-07-13 15:24:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430441887] [2022-07-13 15:24:47,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:24:47,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-13 15:24:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:24:47,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-13 15:24:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 15:24:47,083 INFO L87 Difference]: Start difference. First operand 432 states and 577 transitions. Second operand has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 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-13 15:24:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:24:48,805 INFO L93 Difference]: Finished difference Result 632 states and 823 transitions. [2022-07-13 15:24:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-13 15:24:48,815 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 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 35 [2022-07-13 15:24:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:24:48,818 INFO L225 Difference]: With dead ends: 632 [2022-07-13 15:24:48,818 INFO L226 Difference]: Without dead ends: 630 [2022-07-13 15:24:48,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1311, Invalid=7061, Unknown=0, NotChecked=0, Total=8372 [2022-07-13 15:24:48,820 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 444 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:24:48,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 546 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 707 Invalid, 0 Unknown, 384 Unchecked, 0.3s Time] [2022-07-13 15:24:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-07-13 15:24:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 454. [2022-07-13 15:24:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3311258278145695) internal successors, (603), 453 states have internal predecessors, (603), 0 states have call successors, (0), 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-13 15:24:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 603 transitions. [2022-07-13 15:24:48,870 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 603 transitions. Word has length 35 [2022-07-13 15:24:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:24:48,871 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 603 transitions. [2022-07-13 15:24:48,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 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-13 15:24:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 603 transitions. [2022-07-13 15:24:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:24:48,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:24:48,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:24:48,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 15:24:49,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:49,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:24:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:24:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2022-07-13 15:24:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:24:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293485236] [2022-07-13 15:24:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:24:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:24:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:24:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:24:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:24:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293485236] [2022-07-13 15:24:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293485236] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:24:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397317824] [2022-07-13 15:24:49,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 15:24:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:24:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:24:49,691 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:24:49,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 15:24:49,978 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 15:24:49,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:24:49,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 15:24:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:24:49,993 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 18 treesize of output 16 [2022-07-13 15:24:50,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,051 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:24:50,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2022-07-13 15:24:50,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:24:50,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,263 INFO L356 Elim1Store]: treesize reduction 219, result has 14.1 percent of original size [2022-07-13 15:24:50,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 66 treesize of output 72 [2022-07-13 15:24:50,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:24:50,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,418 INFO L356 Elim1Store]: treesize reduction 195, result has 18.4 percent of original size [2022-07-13 15:24:50,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 66 treesize of output 80 [2022-07-13 15:24:50,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:24:50,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:24:50,568 INFO L356 Elim1Store]: treesize reduction 155, result has 22.1 percent of original size [2022-07-13 15:24:50,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 63 treesize of output 80 [2022-07-13 15:24:51,180 INFO L356 Elim1Store]: treesize reduction 52, result has 14.8 percent of original size [2022-07-13 15:24:51,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 56 treesize of output 35 [2022-07-13 15:24:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:24:51,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:25:37,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 Int) (v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~x~0#1_46| Int) (|v_ULTIMATE.start_main_~x~0#1_47| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_47| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_750))) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_47|)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_46|)) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_46| 4)) v_ArrVal_751))) (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) (- 1))) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-13 15:25:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 15:25:42,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397317824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:25:42,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:25:42,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 21] total 54 [2022-07-13 15:25:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890557091] [2022-07-13 15:25:42,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:25:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-13 15:25:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:25:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-13 15:25:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2201, Unknown=17, NotChecked=102, Total=2862 [2022-07-13 15:25:42,914 INFO L87 Difference]: Start difference. First operand 454 states and 603 transitions. Second operand has 54 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 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-13 15:25:43,667 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse1 (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse0 (select .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= .cse0 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= .cse1 3) (<= 3 .cse1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (forall ((v_ArrVal_751 Int) (v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~x~0#1_46| Int) (|v_ULTIMATE.start_main_~x~0#1_47| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_47| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_750))) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_47|)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_46|)) (<= 0 (select (let ((.cse4 (store .cse3 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_46| 4)) v_ArrVal_751))) (store .cse4 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) (- 1))) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= 4 (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= 1 .cse0) (= (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0)))) is different from false [2022-07-13 15:25:44,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse1 (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse0 (select .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= .cse0 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= .cse1 3) (<= 3 .cse1) (= (select .cse2 0) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (forall ((v_ArrVal_751 Int) (v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~x~0#1_46| Int) (|v_ULTIMATE.start_main_~x~0#1_47| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_47| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_750))) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_47|)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_46|)) (<= 0 (select (let ((.cse4 (store .cse3 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_46| 4)) v_ArrVal_751))) (store .cse4 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) (- 1))) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= 4 (select .cse5 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= 1 .cse0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0)))) is different from false [2022-07-13 15:25:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:25:45,555 INFO L93 Difference]: Finished difference Result 503 states and 658 transitions. [2022-07-13 15:25:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 15:25:45,556 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 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 37 [2022-07-13 15:25:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:25:45,557 INFO L225 Difference]: With dead ends: 503 [2022-07-13 15:25:45,557 INFO L226 Difference]: Without dead ends: 469 [2022-07-13 15:25:45,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=995, Invalid=4400, Unknown=19, NotChecked=438, Total=5852 [2022-07-13 15:25:45,559 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 109 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:25:45,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 351 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 326 Invalid, 0 Unknown, 247 Unchecked, 0.2s Time] [2022-07-13 15:25:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-07-13 15:25:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 449. [2022-07-13 15:25:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.3325892857142858) internal successors, (597), 448 states have internal predecessors, (597), 0 states have call successors, (0), 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-13 15:25:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 597 transitions. [2022-07-13 15:25:45,622 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 597 transitions. Word has length 37 [2022-07-13 15:25:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:25:45,622 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 597 transitions. [2022-07-13 15:25:45,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 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-13 15:25:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 597 transitions. [2022-07-13 15:25:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 15:25:45,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:25:45,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:25:45,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 15:25:45,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:25:45,835 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:25:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:25:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2022-07-13 15:25:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:25:45,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790232546] [2022-07-13 15:25:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:25:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:25:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:25:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:25:46,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:25:46,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790232546] [2022-07-13 15:25:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790232546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:25:46,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668576332] [2022-07-13 15:25:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:25:46,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:25:46,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:25:46,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:25:46,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 15:25:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:25:47,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-13 15:25:47,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:25:47,075 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 18 treesize of output 16 [2022-07-13 15:25:47,128 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:25:47,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2022-07-13 15:25:47,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:25:47,238 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:25:47,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2022-07-13 15:25:47,426 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-13 15:25:47,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 55 [2022-07-13 15:25:47,655 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:25:47,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 71 [2022-07-13 15:25:47,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:25:47,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:25:47,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:25:47,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 18 [2022-07-13 15:25:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:25:47,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:26:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:26:10,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668576332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:26:10,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:26:10,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-13 15:26:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327136803] [2022-07-13 15:26:10,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:26:10,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 15:26:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:26:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 15:26:10,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=668, Unknown=11, NotChecked=0, Total=812 [2022-07-13 15:26:10,106 INFO L87 Difference]: Start difference. First operand 449 states and 597 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 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-13 15:26:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:26:32,085 INFO L93 Difference]: Finished difference Result 869 states and 1125 transitions. [2022-07-13 15:26:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 15:26:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 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 38 [2022-07-13 15:26:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:26:32,088 INFO L225 Difference]: With dead ends: 869 [2022-07-13 15:26:32,088 INFO L226 Difference]: Without dead ends: 689 [2022-07-13 15:26:32,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=395, Invalid=1747, Unknown=20, NotChecked=0, Total=2162 [2022-07-13 15:26:32,089 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 255 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:26:32,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 385 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 299 Invalid, 0 Unknown, 274 Unchecked, 0.3s Time] [2022-07-13 15:26:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-07-13 15:26:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 520. [2022-07-13 15:26:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 1.325626204238921) internal successors, (688), 519 states have internal predecessors, (688), 0 states have call successors, (0), 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-13 15:26:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 688 transitions. [2022-07-13 15:26:32,150 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 688 transitions. Word has length 38 [2022-07-13 15:26:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:26:32,151 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 688 transitions. [2022-07-13 15:26:32,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 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-13 15:26:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 688 transitions. [2022-07-13 15:26:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 15:26:32,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:26:32,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:26:32,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 15:26:32,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:26:32,359 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:26:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:26:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2022-07-13 15:26:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:26:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498373461] [2022-07-13 15:26:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:26:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:26:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 15:26:32,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 15:26:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 15:26:32,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 15:26:32,421 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 15:26:32,422 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:26:32,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 15:26:32,425 INFO L356 BasicCegarLoop]: Path program histogram: [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:26:32,428 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:26:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:26:32 BoogieIcfgContainer [2022-07-13 15:26:32,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:26:32,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:26:32,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:26:32,482 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:26:32,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:23:32" (3/4) ... [2022-07-13 15:26:32,484 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 15:26:32,523 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:26:32,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:26:32,526 INFO L158 Benchmark]: Toolchain (without parser) took 180401.12ms. Allocated memory was 94.4MB in the beginning and 169.9MB in the end (delta: 75.5MB). Free memory was 60.9MB in the beginning and 118.6MB in the end (delta: -57.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,526 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:26:32,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.49ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 68.4MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.61ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 66.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,526 INFO L158 Benchmark]: Boogie Preprocessor took 44.30ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 64.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,526 INFO L158 Benchmark]: RCFGBuilder took 338.89ms. Allocated memory is still 94.4MB. Free memory was 64.2MB in the beginning and 49.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,527 INFO L158 Benchmark]: TraceAbstraction took 179674.56ms. Allocated memory was 94.4MB in the beginning and 169.9MB in the end (delta: 75.5MB). Free memory was 49.0MB in the beginning and 122.8MB in the end (delta: -73.8MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,527 INFO L158 Benchmark]: Witness Printer took 41.16ms. Allocated memory is still 169.9MB. Free memory was 122.8MB in the beginning and 118.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 15:26:32,532 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.49ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 68.4MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.61ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 66.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.30ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 64.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.89ms. Allocated memory is still 94.4MB. Free memory was 64.2MB in the beginning and 49.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 179674.56ms. Allocated memory was 94.4MB in the beginning and 169.9MB in the end (delta: 75.5MB). Free memory was 49.0MB in the beginning and 122.8MB in the end (delta: -73.8MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Witness Printer took 41.16ms. Allocated memory is still 169.9MB. Free memory was 122.8MB in the beginning and 118.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={22:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={21:0}, source=0, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={22:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={22:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] [L63] CALL __VERIFIER_assert(distance[i]>=0) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) [L61] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] [L63] CALL __VERIFIER_assert(distance[i]>=0) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 179.6s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2798 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2798 mSDsluCounter, 4664 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2067 IncrementalHoareTripleChecker+Unchecked, 3948 mSDsCounter, 915 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4283 IncrementalHoareTripleChecker+Invalid, 7265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 915 mSolverCounterUnsat, 716 mSDtfsCounter, 4283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1455 GetRequests, 824 SyntacticMatches, 51 SemanticMatches, 580 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 8561 ImplicationChecksByTransitivity, 162.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=21, InterpolantAutomatonStates: 369, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 1739 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 136.2s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1152 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1559 ConstructedInterpolants, 165 QuantifiedInterpolants, 21260 SizeOfPredicates, 181 NumberOfNonLiveVariables, 4970 ConjunctsInSsa, 389 ConjunctsInUnsatCore, 56 InterpolantComputations, 4 PerfectInterpolantSequences, 259/696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 15:26:32,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE