./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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-tmp.no-commuhash-c3fed41 [2021-12-17 09:27:20,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:27:20,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:27:20,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:27:20,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:27:20,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:27:20,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:27:20,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:27:20,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:27:20,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:27:20,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:27:20,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:27:20,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:27:20,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:27:20,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:27:20,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:27:20,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:27:20,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:27:20,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:27:20,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:27:20,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:27:20,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:27:20,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:27:20,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:27:20,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:27:20,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:27:20,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:27:20,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:27:20,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:27:20,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:27:20,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:27:20,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:27:20,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:27:20,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:27:20,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:27:20,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:27:20,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:27:20,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:27:20,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:27:20,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:27:20,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:27:20,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 09:27:20,580 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:27:20,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:27:20,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:27:20,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:27:20,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:27:20,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:27:20,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:27:20,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:27:20,582 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:27:20,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:27:20,583 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:27:20,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:27:20,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:27:20,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:27:20,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:27:20,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:27:20,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:27:20,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:27:20,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:27:20,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:27:20,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:27:20,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:27:20,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:27:20,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:27:20,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:27:20,587 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:27:20,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:27:20,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:27:20,587 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 [2021-12-17 09:27:20,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:27:20,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:27:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:27:20,830 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:27:20,833 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:27:20,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-1.c [2021-12-17 09:27:20,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f8923da/4d40b2bbec434d2e896cff36cd7f2b0a/FLAG9702ab4a5 [2021-12-17 09:27:21,193 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:27:21,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2021-12-17 09:27:21,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f8923da/4d40b2bbec434d2e896cff36cd7f2b0a/FLAG9702ab4a5 [2021-12-17 09:27:21,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f8923da/4d40b2bbec434d2e896cff36cd7f2b0a [2021-12-17 09:27:21,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:27:21,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:27:21,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:27:21,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:27:21,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:27:21,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8be39b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21, skipping insertion in model container [2021-12-17 09:27:21,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:27:21,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:27:21,813 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] [2021-12-17 09:27:21,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:27:21,856 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:27:21,867 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] [2021-12-17 09:27:21,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:27:21,905 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:27:21,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21 WrapperNode [2021-12-17 09:27:21,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:27:21,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:27:21,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:27:21,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:27:21,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,950 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2021-12-17 09:27:21,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:27:21,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:27:21,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:27:21,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:27:21,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:21,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:27:21,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:27:21,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:27:21,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:27:21,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (1/1) ... [2021-12-17 09:27:22,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:27:22,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:22,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 09:27:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 09:27:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:27:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:27:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:27:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 09:27:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:27:22,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:27:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 09:27:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:27:22,137 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:27:22,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:27:22,273 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:27:22,277 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:27:22,278 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 09:27:22,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:27:22 BoogieIcfgContainer [2021-12-17 09:27:22,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:27:22,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:27:22,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:27:22,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:27:22,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:27:21" (1/3) ... [2021-12-17 09:27:22,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a4440a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:27:22, skipping insertion in model container [2021-12-17 09:27:22,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:27:21" (2/3) ... [2021-12-17 09:27:22,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a4440a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:27:22, skipping insertion in model container [2021-12-17 09:27:22,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:27:22" (3/3) ... [2021-12-17 09:27:22,285 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2021-12-17 09:27:22,288 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:27:22,288 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:27:22,315 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:27:22,320 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 09:27:22,320 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:27:22,328 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) [2021-12-17 09:27:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 09:27:22,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:22,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:22,340 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2021-12-17 09:27:22,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:22,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265220021] [2021-12-17 09:27:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:22,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:22,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:22,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265220021] [2021-12-17 09:27:22,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265220021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:27:22,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:27:22,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 09:27:22,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053898366] [2021-12-17 09:27:22,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:27:22,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 09:27:22,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:22,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 09:27:22,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 09:27:22,597 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) [2021-12-17 09:27:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:22,658 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2021-12-17 09:27:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:27:22,660 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 [2021-12-17 09:27:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:22,665 INFO L225 Difference]: With dead ends: 89 [2021-12-17 09:27:22,665 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 09:27:22,667 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:22,670 INFO L933 BasicCegarLoop]: 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.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:22,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:27:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 09:27:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-12-17 09:27:22,689 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) [2021-12-17 09:27:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-17 09:27:22,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2021-12-17 09:27:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:22,691 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-17 09:27:22,691 INFO L471 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) [2021-12-17 09:27:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-17 09:27:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 09:27:22,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:22,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:22,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:27:22,693 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2021-12-17 09:27:22,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:22,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809518804] [2021-12-17 09:27:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:22,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:22,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:22,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809518804] [2021-12-17 09:27:22,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809518804] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210506023] [2021-12-17 09:27:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:22,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:22,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:22,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:27:22,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 09:27:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:23,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 09:27:23,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:23,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:27:23,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:27:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:23,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:23,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-17 09:27:23,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-12-17 09:27:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:23,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210506023] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:23,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:23,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-17 09:27:23,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993351288] [2021-12-17 09:27:23,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:23,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 09:27:23,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 09:27:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-17 09:27:23,301 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) [2021-12-17 09:27:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:23,451 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2021-12-17 09:27:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 09:27:23,451 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 [2021-12-17 09:27:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:23,452 INFO L225 Difference]: With dead ends: 84 [2021-12-17 09:27:23,452 INFO L226 Difference]: Without dead ends: 82 [2021-12-17 09:27:23,453 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:23,454 INFO L933 BasicCegarLoop]: 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 [2021-12-17 09:27:23,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-17 09:27:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2021-12-17 09:27:23,459 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) [2021-12-17 09:27:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2021-12-17 09:27:23,460 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2021-12-17 09:27:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:23,460 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2021-12-17 09:27:23,460 INFO L471 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) [2021-12-17 09:27:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2021-12-17 09:27:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 09:27:23,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:23,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:23,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:23,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:23,679 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2021-12-17 09:27:23,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:23,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47675685] [2021-12-17 09:27:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:23,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:23,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47675685] [2021-12-17 09:27:23,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47675685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:27:23,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:27:23,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:27:23,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901960008] [2021-12-17 09:27:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:27:23,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:27:23,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:27:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:27:23,731 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) [2021-12-17 09:27:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:23,761 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-12-17 09:27:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:27:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 09:27:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:23,762 INFO L225 Difference]: With dead ends: 66 [2021-12-17 09:27:23,765 INFO L226 Difference]: Without dead ends: 45 [2021-12-17 09:27:23,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:27:23,768 INFO L933 BasicCegarLoop]: 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 [2021-12-17 09:27:23,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:27:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-17 09:27:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-12-17 09:27:23,773 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) [2021-12-17 09:27:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2021-12-17 09:27:23,773 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2021-12-17 09:27:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:23,773 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2021-12-17 09:27:23,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2021-12-17 09:27:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 09:27:23,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:23,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:23,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 09:27:23,774 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2021-12-17 09:27:23,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:23,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651315102] [2021-12-17 09:27:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:23,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:23,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651315102] [2021-12-17 09:27:23,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651315102] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451747031] [2021-12-17 09:27:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:23,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:23,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:23,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:27:23,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 09:27:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:23,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 09:27:23,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:23,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:23,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451747031] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:23,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:23,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-17 09:27:23,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917471828] [2021-12-17 09:27:23,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:23,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 09:27:23,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 09:27:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-17 09:27:23,966 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) [2021-12-17 09:27:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:24,065 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2021-12-17 09:27:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 09:27:24,066 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 [2021-12-17 09:27:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:24,066 INFO L225 Difference]: With dead ends: 114 [2021-12-17 09:27:24,067 INFO L226 Difference]: Without dead ends: 86 [2021-12-17 09:27:24,067 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:24,068 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-12-17 09:27:24,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-17 09:27:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2021-12-17 09:27:24,073 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) [2021-12-17 09:27:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2021-12-17 09:27:24,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2021-12-17 09:27:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:24,074 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2021-12-17 09:27:24,074 INFO L471 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) [2021-12-17 09:27:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2021-12-17 09:27:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 09:27:24,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:24,075 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:24,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:24,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 09:27:24,289 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2021-12-17 09:27:24,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:24,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665881716] [2021-12-17 09:27:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:24,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:24,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:24,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665881716] [2021-12-17 09:27:24,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665881716] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:24,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027574707] [2021-12-17 09:27:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:24,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:24,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:24,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:27:24,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 09:27:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:24,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:27:24,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:24,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:24,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027574707] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:24,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:24,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 09:27:24,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847810949] [2021-12-17 09:27:24,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:24,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:27:24,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:27:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:27:24,560 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) [2021-12-17 09:27:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:24,705 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2021-12-17 09:27:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 09:27:24,706 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 [2021-12-17 09:27:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:24,707 INFO L225 Difference]: With dead ends: 181 [2021-12-17 09:27:24,707 INFO L226 Difference]: Without dead ends: 159 [2021-12-17 09:27:24,707 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:24,708 INFO L933 BasicCegarLoop]: 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 [2021-12-17 09:27:24,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 155 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-17 09:27:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2021-12-17 09:27:24,715 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) [2021-12-17 09:27:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2021-12-17 09:27:24,715 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2021-12-17 09:27:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:24,716 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-12-17 09:27:24,716 INFO L471 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) [2021-12-17 09:27:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2021-12-17 09:27:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 09:27:24,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:24,717 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:24,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:24,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:24,936 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2021-12-17 09:27:24,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85178756] [2021-12-17 09:27:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:24,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:25,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:25,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85178756] [2021-12-17 09:27:25,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85178756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:25,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611963262] [2021-12-17 09:27:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:25,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:25,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:25,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:27:25,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 09:27:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:25,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:27:25,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:25,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:25,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611963262] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:25,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:25,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 09:27:25,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39120088] [2021-12-17 09:27:25,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:25,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:27:25,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:27:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:27:25,176 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) [2021-12-17 09:27:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:25,270 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2021-12-17 09:27:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 09:27:25,270 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 [2021-12-17 09:27:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:25,271 INFO L225 Difference]: With dead ends: 206 [2021-12-17 09:27:25,271 INFO L226 Difference]: Without dead ends: 146 [2021-12-17 09:27:25,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 09:27:25,272 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-12-17 09:27:25,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-17 09:27:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2021-12-17 09:27:25,278 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) [2021-12-17 09:27:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2021-12-17 09:27:25,279 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2021-12-17 09:27:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:25,279 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-12-17 09:27:25,279 INFO L471 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) [2021-12-17 09:27:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2021-12-17 09:27:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 09:27:25,280 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:25,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:25,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 09:27:25,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:25,494 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2021-12-17 09:27:25,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:25,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33028778] [2021-12-17 09:27:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:25,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:25,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33028778] [2021-12-17 09:27:25,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33028778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421994542] [2021-12-17 09:27:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:25,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:25,865 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) [2021-12-17 09:27:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 09:27:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:25,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 09:27:25,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:25,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:27:25,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-17 09:27:26,118 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:27:26,119 INFO L388 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 [2021-12-17 09:27:26,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 09:27:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:26,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:26,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421994542] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:26,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:26,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2021-12-17 09:27:26,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146429006] [2021-12-17 09:27:26,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:26,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 09:27:26,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 09:27:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-12-17 09:27:26,491 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:26,918 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2021-12-17 09:27:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 09:27:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-17 09:27:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:26,920 INFO L225 Difference]: With dead ends: 190 [2021-12-17 09:27:26,920 INFO L226 Difference]: Without dead ends: 176 [2021-12-17 09:27:26,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 09:27:26,921 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 306 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:26,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 293 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 236 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2021-12-17 09:27:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-17 09:27:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 96. [2021-12-17 09:27:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2021-12-17 09:27:26,928 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 25 [2021-12-17 09:27:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:26,928 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2021-12-17 09:27:26,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2021-12-17 09:27:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 09:27:26,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:26,929 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:26,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:27,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:27,146 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2021-12-17 09:27:27,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:27,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885696877] [2021-12-17 09:27:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:27,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:27,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:27,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885696877] [2021-12-17 09:27:27,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885696877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416022608] [2021-12-17 09:27:27,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:27:27,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:27,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:27,236 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) [2021-12-17 09:27:27,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 09:27:27,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:27:27,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:27,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 09:27:27,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:27,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 09:27:27,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:27:27,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:27:27,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:27:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:27,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:29,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((v_ArrVal_253 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_253) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_66| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 09:27:29,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-17 09:27:29,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2021-12-17 09:27:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2021-12-17 09:27:29,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416022608] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:29,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:29,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2021-12-17 09:27:29,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369212213] [2021-12-17 09:27:29,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:29,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 09:27:29,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 09:27:29,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2021-12-17 09:27:29,659 INFO L87 Difference]: Start difference. First operand 96 states and 126 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) [2021-12-17 09:27:31,674 WARN L838 $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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((v_ArrVal_253 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_253) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_66| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-17 09:27:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:31,891 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2021-12-17 09:27:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 09:27:31,892 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 [2021-12-17 09:27:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:31,893 INFO L225 Difference]: With dead ends: 214 [2021-12-17 09:27:31,893 INFO L226 Difference]: Without dead ends: 212 [2021-12-17 09:27:31,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=118, Invalid=350, Unknown=2, NotChecked=82, Total=552 [2021-12-17 09:27:31,894 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:31,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 193 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 199 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2021-12-17 09:27:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-17 09:27:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2021-12-17 09:27:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2021-12-17 09:27:31,916 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 25 [2021-12-17 09:27:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:31,917 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2021-12-17 09:27:31,917 INFO L471 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) [2021-12-17 09:27:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2021-12-17 09:27:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 09:27:31,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:31,918 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:31,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:32,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:32,127 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2021-12-17 09:27:32,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:32,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611366455] [2021-12-17 09:27:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:32,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:32,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:32,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611366455] [2021-12-17 09:27:32,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611366455] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:32,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632253828] [2021-12-17 09:27:32,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:27:32,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:32,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:32,187 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) [2021-12-17 09:27:32,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 09:27:32,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:27:32,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:32,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:27:32,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:32,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:32,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632253828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:32,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:32,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 09:27:32,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681144972] [2021-12-17 09:27:32,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:32,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:27:32,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:27:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:27:32,379 INFO L87 Difference]: Start difference. First operand 119 states and 160 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) [2021-12-17 09:27:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:32,497 INFO L93 Difference]: Finished difference Result 234 states and 298 transitions. [2021-12-17 09:27:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 09:27:32,497 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 [2021-12-17 09:27:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:32,498 INFO L225 Difference]: With dead ends: 234 [2021-12-17 09:27:32,498 INFO L226 Difference]: Without dead ends: 221 [2021-12-17 09:27:32,499 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:32,499 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:32,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 185 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-17 09:27:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2021-12-17 09:27:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 161 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2021-12-17 09:27:32,525 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 28 [2021-12-17 09:27:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:32,525 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2021-12-17 09:27:32,525 INFO L471 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) [2021-12-17 09:27:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2021-12-17 09:27:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 09:27:32,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:32,527 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:32,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:32,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:32,744 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -483995622, now seen corresponding path program 3 times [2021-12-17 09:27:32,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:32,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914260437] [2021-12-17 09:27:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:32,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 09:27:32,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:32,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914260437] [2021-12-17 09:27:32,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914260437] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:32,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038438772] [2021-12-17 09:27:32,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:27:32,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:32,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:32,782 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) [2021-12-17 09:27:32,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 09:27:32,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:27:32,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:32,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 09:27:32,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:32,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:33,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038438772] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:33,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:33,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 14 [2021-12-17 09:27:33,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245576818] [2021-12-17 09:27:33,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:33,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 09:27:33,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:33,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 09:27:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-17 09:27:33,055 INFO L87 Difference]: Start difference. First operand 162 states and 217 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:33,293 INFO L93 Difference]: Finished difference Result 419 states and 547 transitions. [2021-12-17 09:27:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:27:33,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-17 09:27:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:33,295 INFO L225 Difference]: With dead ends: 419 [2021-12-17 09:27:33,295 INFO L226 Difference]: Without dead ends: 289 [2021-12-17 09:27:33,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-12-17 09:27:33,296 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 219 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:33,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 285 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-17 09:27:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 142. [2021-12-17 09:27:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.297872340425532) internal successors, (183), 141 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2021-12-17 09:27:33,303 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 28 [2021-12-17 09:27:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:33,303 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2021-12-17 09:27:33,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2021-12-17 09:27:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 09:27:33,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:33,304 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:33,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:33,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 09:27:33,521 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2021-12-17 09:27:33,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:33,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037082407] [2021-12-17 09:27:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:33,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:33,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:33,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037082407] [2021-12-17 09:27:33,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037082407] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:33,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073527299] [2021-12-17 09:27:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:33,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:33,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:33,702 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) [2021-12-17 09:27:33,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 09:27:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:33,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 09:27:33,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:33,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:27:34,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 09:27:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:34,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:34,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-17 09:27:34,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-12-17 09:27:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:34,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073527299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:34,253 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:34,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-17 09:27:34,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574542430] [2021-12-17 09:27:34,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:34,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 09:27:34,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 09:27:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-17 09:27:34,255 INFO L87 Difference]: Start difference. First operand 142 states and 183 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) [2021-12-17 09:27:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:34,738 INFO L93 Difference]: Finished difference Result 274 states and 346 transitions. [2021-12-17 09:27:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 09:27:34,748 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 [2021-12-17 09:27:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:34,750 INFO L225 Difference]: With dead ends: 274 [2021-12-17 09:27:34,750 INFO L226 Difference]: Without dead ends: 272 [2021-12-17 09:27:34,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 09:27:34,751 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 209 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:34,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 285 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 09:27:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-17 09:27:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 191. [2021-12-17 09:27:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.3) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2021-12-17 09:27:34,762 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 29 [2021-12-17 09:27:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:34,762 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2021-12-17 09:27:34,762 INFO L471 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) [2021-12-17 09:27:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2021-12-17 09:27:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 09:27:34,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:34,763 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:34,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-17 09:27:34,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:34,979 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:34,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2021-12-17 09:27:34,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:34,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451449120] [2021-12-17 09:27:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:34,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:35,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:35,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451449120] [2021-12-17 09:27:35,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451449120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:35,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280098352] [2021-12-17 09:27:35,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:27:35,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:35,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:35,358 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) [2021-12-17 09:27:35,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 09:27:35,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:27:35,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:35,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-17 09:27:35,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:35,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:27:35,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:27:35,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 09:27:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:27:35,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:27:35,676 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 09:27:35,676 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2021-12-17 09:27:35,775 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:27:35,775 INFO L388 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2021-12-17 09:27:35,986 INFO L388 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 [2021-12-17 09:27:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:36,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:38,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_23| Int)) (or (forall ((v_ArrVal_421 Int) (v_ArrVal_420 Int)) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_23| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_420))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 4)) v_ArrVal_421)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_23| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-17 09:27:39,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 Int) (v_ArrVal_420 Int) (|v_ULTIMATE.start_main_~x~0#1_23| Int)) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_23| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_420))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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)) 4)) v_ArrVal_421)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_23| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) is different from false [2021-12-17 09:27:41,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 Int) (v_ArrVal_420 Int) (|v_ULTIMATE.start_main_~x~0#1_23| Int) (v_ArrVal_418 Int)) (let ((.cse0 (store (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|) v_ArrVal_418))) (or (< |v_ULTIMATE.start_main_~x~0#1_23| (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|)) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_23| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_420))) (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| 4)) 4)) v_ArrVal_421)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< v_ArrVal_418 0)))) is different from false [2021-12-17 09:27:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2021-12-17 09:27:41,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280098352] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:41,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:41,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2021-12-17 09:27:41,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925359474] [2021-12-17 09:27:41,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:41,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-17 09:27:41,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-17 09:27:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=674, Unknown=4, NotChecked=168, Total=992 [2021-12-17 09:27:41,379 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 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) [2021-12-17 09:27:41,863 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((v_ArrVal_421 Int) (v_ArrVal_420 Int) (|v_ULTIMATE.start_main_~x~0#1_23| Int)) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_23| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_420))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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)) 4)) v_ArrVal_421)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_23| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (= (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) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) is different from false [2021-12-17 09:27:42,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((v_ArrVal_421 Int) (v_ArrVal_420 Int) (|v_ULTIMATE.start_main_~x~0#1_23| Int)) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_23| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_420))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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)) 4)) v_ArrVal_421)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_23| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) is different from false [2021-12-17 09:27:44,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_23| Int)) (or (forall ((v_ArrVal_421 Int) (v_ArrVal_420 Int)) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_23| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_420))) (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_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 4)) v_ArrVal_421)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_23| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) is different from false [2021-12-17 09:27:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:44,560 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2021-12-17 09:27:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 09:27:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 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 [2021-12-17 09:27:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:44,562 INFO L225 Difference]: With dead ends: 230 [2021-12-17 09:27:44,562 INFO L226 Difference]: Without dead ends: 203 [2021-12-17 09:27:44,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=229, Invalid=978, Unknown=7, NotChecked=426, Total=1640 [2021-12-17 09:27:44,563 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:44,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 218 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 169 Unchecked, 0.1s Time] [2021-12-17 09:27:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-17 09:27:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2021-12-17 09:27:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2021-12-17 09:27:44,579 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 31 [2021-12-17 09:27:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:44,579 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2021-12-17 09:27:44,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 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) [2021-12-17 09:27:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2021-12-17 09:27:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 09:27:44,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:44,582 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:44,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:44,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 09:27:44,803 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2021-12-17 09:27:44,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:44,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288152802] [2021-12-17 09:27:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:44,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 09:27:44,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:44,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288152802] [2021-12-17 09:27:44,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288152802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:27:44,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:27:44,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 09:27:44,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172429983] [2021-12-17 09:27:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:27:44,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 09:27:44,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 09:27:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 09:27:44,838 INFO L87 Difference]: Start difference. First operand 194 states and 251 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) [2021-12-17 09:27:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:44,861 INFO L93 Difference]: Finished difference Result 325 states and 419 transitions. [2021-12-17 09:27:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:27:44,862 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 [2021-12-17 09:27:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:44,862 INFO L225 Difference]: With dead ends: 325 [2021-12-17 09:27:44,863 INFO L226 Difference]: Without dead ends: 226 [2021-12-17 09:27:44,863 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:44,863 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:44,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 73 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:27:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-17 09:27:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2021-12-17 09:27:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.2849740932642486) internal successors, (248), 193 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 248 transitions. [2021-12-17 09:27:44,873 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 248 transitions. Word has length 31 [2021-12-17 09:27:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:44,873 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 248 transitions. [2021-12-17 09:27:44,873 INFO L471 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) [2021-12-17 09:27:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 248 transitions. [2021-12-17 09:27:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 09:27:44,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:44,874 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:27:44,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 09:27:44,874 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 810953566, now seen corresponding path program 4 times [2021-12-17 09:27:44,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:44,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261491306] [2021-12-17 09:27:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:44,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 09:27:44,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:44,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261491306] [2021-12-17 09:27:44,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261491306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756575954] [2021-12-17 09:27:44,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:27:44,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:44,994 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) [2021-12-17 09:27:44,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 09:27:45,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:27:45,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:45,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-17 09:27:45,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:45,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 09:27:45,088 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-17 09:27:45,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-12-17 09:27:45,130 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-17 09:27:45,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-12-17 09:27:45,482 INFO L354 Elim1Store]: treesize reduction 10, result has 23.1 percent of original size [2021-12-17 09:27:45,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2021-12-17 09:27:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:45,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:27:46,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756575954] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:46,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:46,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 35 [2021-12-17 09:27:46,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644607870] [2021-12-17 09:27:46,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:46,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-17 09:27:46,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-17 09:27:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=957, Unknown=1, NotChecked=0, Total=1190 [2021-12-17 09:27:46,182 INFO L87 Difference]: Start difference. First operand 194 states and 248 transitions. Second operand has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:48,087 INFO L93 Difference]: Finished difference Result 653 states and 830 transitions. [2021-12-17 09:27:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-12-17 09:27:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 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 [2021-12-17 09:27:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:48,090 INFO L225 Difference]: With dead ends: 653 [2021-12-17 09:27:48,090 INFO L226 Difference]: Without dead ends: 651 [2021-12-17 09:27:48,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1919, Invalid=6822, Unknown=1, NotChecked=0, Total=8742 [2021-12-17 09:27:48,093 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 669 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:48,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 528 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 775 Invalid, 0 Unknown, 487 Unchecked, 0.5s Time] [2021-12-17 09:27:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-17 09:27:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 234. [2021-12-17 09:27:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2832618025751072) internal successors, (299), 233 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 299 transitions. [2021-12-17 09:27:48,120 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 299 transitions. Word has length 31 [2021-12-17 09:27:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:48,121 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 299 transitions. [2021-12-17 09:27:48,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 299 transitions. [2021-12-17 09:27:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 09:27:48,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:48,122 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:48,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:48,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 09:27:48,335 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:48,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2021-12-17 09:27:48,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:48,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510991933] [2021-12-17 09:27:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:48,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:48,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510991933] [2021-12-17 09:27:48,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510991933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345010158] [2021-12-17 09:27:48,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:27:48,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:48,422 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) [2021-12-17 09:27:48,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 09:27:48,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:27:48,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:48,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 09:27:48,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:48,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:27:48,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345010158] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:48,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:48,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 09:27:48,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73031094] [2021-12-17 09:27:48,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:48,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 09:27:48,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 09:27:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 09:27:48,645 INFO L87 Difference]: Start difference. First operand 234 states and 299 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) [2021-12-17 09:27:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:48,879 INFO L93 Difference]: Finished difference Result 501 states and 629 transitions. [2021-12-17 09:27:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 09:27:48,880 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 [2021-12-17 09:27:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:48,881 INFO L225 Difference]: With dead ends: 501 [2021-12-17 09:27:48,882 INFO L226 Difference]: Without dead ends: 399 [2021-12-17 09:27:48,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-12-17 09:27:48,883 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 302 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:48,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 151 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-12-17 09:27:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 284. [2021-12-17 09:27:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.2826855123674912) internal successors, (363), 283 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 363 transitions. [2021-12-17 09:27:48,941 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 363 transitions. Word has length 33 [2021-12-17 09:27:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:48,941 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 363 transitions. [2021-12-17 09:27:48,941 INFO L471 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) [2021-12-17 09:27:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 363 transitions. [2021-12-17 09:27:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 09:27:48,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:48,943 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:48,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 09:27:49,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 09:27:49,160 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2021-12-17 09:27:49,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880744999] [2021-12-17 09:27:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:49,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:49,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880744999] [2021-12-17 09:27:49,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880744999] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348852192] [2021-12-17 09:27:49,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:27:49,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:49,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:49,227 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) [2021-12-17 09:27:49,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 09:27:49,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:27:49,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:49,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 09:27:49,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:49,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:27:49,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348852192] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:27:49,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:27:49,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 09:27:49,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977749900] [2021-12-17 09:27:49,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:27:49,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 09:27:49,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:27:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 09:27:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-17 09:27:49,467 INFO L87 Difference]: Start difference. First operand 284 states and 363 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) [2021-12-17 09:27:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:27:49,681 INFO L93 Difference]: Finished difference Result 640 states and 810 transitions. [2021-12-17 09:27:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 09:27:49,681 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 [2021-12-17 09:27:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:27:49,683 INFO L225 Difference]: With dead ends: 640 [2021-12-17 09:27:49,683 INFO L226 Difference]: Without dead ends: 615 [2021-12-17 09:27:49,684 INFO L932 BasicCegarLoop]: 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 [2021-12-17 09:27:49,684 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 158 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:27:49,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 238 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:27:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-17 09:27:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 396. [2021-12-17 09:27:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3113924050632912) internal successors, (518), 395 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:27:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 518 transitions. [2021-12-17 09:27:49,717 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 518 transitions. Word has length 34 [2021-12-17 09:27:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:27:49,717 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 518 transitions. [2021-12-17 09:27:49,718 INFO L471 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) [2021-12-17 09:27:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 518 transitions. [2021-12-17 09:27:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 09:27:49,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:27:49,718 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:27:49,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-17 09:27:49,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-17 09:27:49,935 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:27:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:27:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2021-12-17 09:27:49,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:27:49,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133645934] [2021-12-17 09:27:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:27:49,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:27:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:27:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:27:50,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:27:50,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133645934] [2021-12-17 09:27:50,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133645934] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:27:50,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692357291] [2021-12-17 09:27:50,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:27:50,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:27:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:27:50,492 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) [2021-12-17 09:27:50,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 09:27:50,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:27:50,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:27:50,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-17 09:27:50,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:27:50,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:27:50,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:27:50,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:27:50,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 09:27:50,778 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 09:27:50,778 INFO L388 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 [2021-12-17 09:27:50,872 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 09:27:50,872 INFO L388 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 [2021-12-17 09:27:51,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 09:27:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:27:51,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:27:53,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int)) (or (forall ((v_ArrVal_625 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_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-17 09:27:53,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int)) (or (<= 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_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) is different from false [2021-12-17 09:27:54,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~x~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (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|))))) is different from false [2021-12-17 09:27:56,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_33| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_32| (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|)) (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))))) is different from false [2021-12-17 09:27:57,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_33| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (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_32| (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|)) (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-17 09:28:21,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_620 Int) (|v_ULTIMATE.start_main_~x~0#1_33| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (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_150| 4)) v_ArrVal_620))) (let ((.cse1 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (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|)) (<= 0 (select (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (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|)))))))) is different from false [2021-12-17 09:28:23,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_ULTIMATE.start_main_~x~0#1_33| Int) (v_ArrVal_619 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse1 (store (store (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|) v_ArrVal_619) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_620))) (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (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_ArrVal_619 0) (< |v_ULTIMATE.start_main_~x~0#1_33| (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|)) (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2021-12-17 09:28:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 17 not checked. [2021-12-17 09:28:24,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692357291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:28:24,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:28:24,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 35 [2021-12-17 09:28:24,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732788315] [2021-12-17 09:28:24,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:28:24,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-17 09:28:24,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:28:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-17 09:28:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=618, Unknown=10, NotChecked=406, Total=1190 [2021-12-17 09:28:24,133 INFO L87 Difference]: Start difference. First operand 396 states and 518 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:26,155 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_620 Int) (|v_ULTIMATE.start_main_~x~0#1_33| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (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_150| 4)) v_ArrVal_620))) (let ((.cse1 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (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|)) (<= 0 (select (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (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|)))))))) (= |c_ULTIMATE.start_main_~#distance~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) (= (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) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-17 09:28:26,767 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1_33| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (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_32| (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|)) (<= 0 (select (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (not (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)) (= .cse2 1) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 .cse2) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) is different from false [2021-12-17 09:28:27,362 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_33| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (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_32| (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|)) (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-17 09:28:29,460 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_33| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_33| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_33| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (< |v_ULTIMATE.start_main_~x~0#1_32| (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|)) (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))))) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-17 09:28:29,928 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~x~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (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|))))) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= |c_ULTIMATE.start_main_~x~0#1| 1)) is different from false [2021-12-17 09:28:30,297 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int)) (or (<= 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_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (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_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 1) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-17 09:28:30,663 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_625 Int)) (or (<= 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_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-17 09:28:32,679 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int)) (or (forall ((v_ArrVal_625 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_32| 4)) v_ArrVal_625) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 1) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) is different from false [2021-12-17 09:28:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:28:32,966 INFO L93 Difference]: Finished difference Result 456 states and 585 transitions. [2021-12-17 09:28:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:28:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-17 09:28:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:28:32,967 INFO L225 Difference]: With dead ends: 456 [2021-12-17 09:28:32,967 INFO L226 Difference]: Without dead ends: 454 [2021-12-17 09:28:32,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=348, Invalid=1100, Unknown=18, NotChecked=1290, Total=2756 [2021-12-17 09:28:32,969 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 139 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:28:32,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 244 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 231 Invalid, 0 Unknown, 428 Unchecked, 0.2s Time] [2021-12-17 09:28:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-12-17 09:28:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 426. [2021-12-17 09:28:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.3035294117647058) internal successors, (554), 425 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2021-12-17 09:28:32,994 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 34 [2021-12-17 09:28:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:28:32,994 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2021-12-17 09:28:32,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2021-12-17 09:28:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 09:28:32,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:28:32,995 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 09:28:33,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 09:28:33,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:28:33,207 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:28:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:28:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1532756638, now seen corresponding path program 1 times [2021-12-17 09:28:33,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:28:33,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765744386] [2021-12-17 09:28:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:28:33,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:28:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:28:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:28:33,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:28:33,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765744386] [2021-12-17 09:28:33,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765744386] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:28:33,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327442165] [2021-12-17 09:28:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:28:33,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:28:33,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:28:33,552 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) [2021-12-17 09:28:33,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 09:28:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:28:33,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 09:28:33,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:28:33,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2021-12-17 09:28:33,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:28:33,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:33,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 09:28:33,922 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:28:33,922 INFO L388 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 [2021-12-17 09:28:34,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 09:28:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:28:34,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:28:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:28:35,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327442165] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:28:35,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:28:35,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2021-12-17 09:28:35,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971094293] [2021-12-17 09:28:35,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:28:35,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 09:28:35,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:28:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 09:28:35,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=571, Unknown=1, NotChecked=0, Total=702 [2021-12-17 09:28:35,257 INFO L87 Difference]: Start difference. First operand 426 states and 554 transitions. Second operand has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:28:35,504 INFO L93 Difference]: Finished difference Result 536 states and 687 transitions. [2021-12-17 09:28:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 09:28:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-17 09:28:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:28:35,515 INFO L225 Difference]: With dead ends: 536 [2021-12-17 09:28:35,515 INFO L226 Difference]: Without dead ends: 534 [2021-12-17 09:28:35,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=225, Invalid=830, Unknown=1, NotChecked=0, Total=1056 [2021-12-17 09:28:35,517 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:28:35,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 462 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 250 Unchecked, 0.1s Time] [2021-12-17 09:28:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-12-17 09:28:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 437. [2021-12-17 09:28:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3073394495412844) internal successors, (570), 436 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 570 transitions. [2021-12-17 09:28:35,574 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 570 transitions. Word has length 34 [2021-12-17 09:28:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:28:35,574 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 570 transitions. [2021-12-17 09:28:35,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 570 transitions. [2021-12-17 09:28:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:28:35,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:28:35,591 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:28:35,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 09:28:35,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 09:28:35,792 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:28:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:28:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2021-12-17 09:28:35,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:28:35,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069110068] [2021-12-17 09:28:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:28:35,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:28:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:28:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:28:36,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:28:36,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069110068] [2021-12-17 09:28:36,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069110068] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:28:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221188468] [2021-12-17 09:28:36,510 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 09:28:36,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:28:36,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:28:36,514 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) [2021-12-17 09:28:36,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 09:28:36,765 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-17 09:28:36,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:28:36,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-17 09:28:36,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:28:36,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:28:36,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:36,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:36,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:36,918 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:28:36,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 69 treesize of output 86 [2021-12-17 09:28:37,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,382 INFO L354 Elim1Store]: treesize reduction 221, result has 18.1 percent of original size [2021-12-17 09:28:37,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 38 case distinctions, treesize of input 88 treesize of output 110 [2021-12-17 09:28:37,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,666 INFO L354 Elim1Store]: treesize reduction 257, result has 17.1 percent of original size [2021-12-17 09:28:37,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 38 case distinctions, treesize of input 91 treesize of output 114 [2021-12-17 09:28:37,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:28:37,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:28:37,873 INFO L354 Elim1Store]: treesize reduction 144, result has 20.0 percent of original size [2021-12-17 09:28:37,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 78 treesize of output 97 [2021-12-17 09:28:38,512 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-12-17 09:28:38,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 24 case distinctions, treesize of input 64 treesize of output 40 [2021-12-17 09:28:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:28:38,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:28:40,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_43| Int)) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int)) (<= 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| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 4)) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-17 09:28:42,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 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| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (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|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))))) is different from false [2021-12-17 09:28:44,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~x~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_727)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 0 (select (let ((.cse0 (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))))) is different from false [2021-12-17 09:28:46,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_727))) (or (<= 0 (select (let ((.cse0 (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))))))) is different from false [2021-12-17 09:28:48,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4)) v_ArrVal_727))) (or (< |v_ULTIMATE.start_main_~x~0#1_43| (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))) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (store .cse1 (+ (* (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) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-17 09:28:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2021-12-17 09:28:58,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221188468] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:28:58,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:28:58,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 45 [2021-12-17 09:28:58,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761981844] [2021-12-17 09:28:58,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:28:58,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-17 09:28:58,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:28:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-17 09:28:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1320, Unknown=6, NotChecked=400, Total=1980 [2021-12-17 09:28:58,436 INFO L87 Difference]: Start difference. First operand 437 states and 570 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:28:59,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse4 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4)) v_ArrVal_727))) (or (< |v_ULTIMATE.start_main_~x~0#1_43| (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))) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (store .cse1 (+ (* (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) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (<= 3 .cse4) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Source~0#1.offset| 8)) 1) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 4) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= .cse4 3) (= (select .cse5 |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)))) is different from false [2021-12-17 09:28:59,656 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse4 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4)) v_ArrVal_727))) (or (< |v_ULTIMATE.start_main_~x~0#1_43| (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))) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (store .cse1 (+ (* (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) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= (select .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= (select .cse3 0) 0) (<= 3 .cse4) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Source~0#1.offset| 8)) 1) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 4) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= .cse4 3) (= (select .cse5 |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)))) is different from false [2021-12-17 09:29:00,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= |c_ULTIMATE.start_main_~j~0#1| 0) (<= 3 .cse1) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Source~0#1.offset| 8)) 1) (= (select .cse3 0) 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 4) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_727))) (or (<= 0 (select (let ((.cse4 (store .cse6 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (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|) (+ .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse6) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))))))) (= .cse1 3) (= (select .cse2 |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)))) is different from false [2021-12-17 09:29:00,784 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse5 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= |c_ULTIMATE.start_main_~x~0#1| (select .cse0 (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))) (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~x~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_727)) (.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 0 (select (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_43| 4)) v_ArrVal_729))) (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|) (+ .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))))) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Source~0#1.offset| 8)) 1) (<= 3 .cse5) (= (select .cse6 0) 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 4) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= .cse5 3) (= (select .cse4 |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x~0#1| 1)))) is different from false [2021-12-17 09:29:01,265 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse4 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (<= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int)) (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 0 (select (let ((.cse1 (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_43| 4)) v_ArrVal_729))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))))) (<= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select .cse3 0) 0) (<= 3 .cse4) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#Source~0#1.offset| 8)) 1) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 4) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= .cse4 3) (= (select .cse5 |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0)))) is different from false [2021-12-17 09:29:03,268 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 4 |c_ULTIMATE.start_main_~j~0#1|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (<= .cse0 4) (= |c_ULTIMATE.start_main_~j~0#1| 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (< 3 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (= (select .cse2 0) 0) (<= 3 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Source~0#1.offset| 8)) 1) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 4) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1_43| Int)) (or (forall ((v_ArrVal_730 Int) (v_ArrVal_729 Int)) (<= 0 (select (let ((.cse4 (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_43| 4)) v_ArrVal_729))) (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_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 4)) v_ArrVal_730)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_43| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 3) (= (select .cse3 |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0))) is different from false [2021-12-17 09:29:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:29:03,787 INFO L93 Difference]: Finished difference Result 468 states and 604 transitions. [2021-12-17 09:29:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 09:29:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 09:29:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:29:03,791 INFO L225 Difference]: With dead ends: 468 [2021-12-17 09:29:03,791 INFO L226 Difference]: Without dead ends: 450 [2021-12-17 09:29:03,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=387, Invalid=2095, Unknown=12, NotChecked=1166, Total=3660 [2021-12-17 09:29:03,793 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:29:03,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 256 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 174 Unchecked, 0.0s Time] [2021-12-17 09:29:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-12-17 09:29:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 445. [2021-12-17 09:29:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.3063063063063063) internal successors, (580), 444 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 580 transitions. [2021-12-17 09:29:03,821 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 580 transitions. Word has length 37 [2021-12-17 09:29:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:29:03,821 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 580 transitions. [2021-12-17 09:29:03,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 580 transitions. [2021-12-17 09:29:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:29:03,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:29:03,822 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:29:03,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 09:29:04,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:04,041 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:29:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:29:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1198222035, now seen corresponding path program 1 times [2021-12-17 09:29:04,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:29:04,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798565207] [2021-12-17 09:29:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:04,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:29:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:29:04,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:29:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798565207] [2021-12-17 09:29:04,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798565207] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:29:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954002256] [2021-12-17 09:29:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:04,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:29:04,605 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) [2021-12-17 09:29:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 09:29:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:04,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 09:29:04,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:29:04,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:29:04,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:04,939 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:29:04,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 69 treesize of output 86 [2021-12-17 09:29:05,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:29:05,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:05,455 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-17 09:29:05,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 18 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 91 treesize of output 105 [2021-12-17 09:29:05,670 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 09:29:05,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 76 treesize of output 95 [2021-12-17 09:29:06,318 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:29:06,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 64 treesize of output 32 [2021-12-17 09:29:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 09:29:06,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:29:09,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_50| Int)) (or (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int)) (<= 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| (* |v_ULTIMATE.start_main_~x~0#1_50| 4)) v_ArrVal_783))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 4)) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-17 09:29:11,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int) (|v_ULTIMATE.start_main_~x~0#1_50| Int)) (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 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| (* |v_ULTIMATE.start_main_~x~0#1_50| 4)) v_ArrVal_783))) (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|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))))) is different from false [2021-12-17 09:29:13,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int) (|v_ULTIMATE.start_main_~x~0#1_50| Int)) (or (<= 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| (* |v_ULTIMATE.start_main_~x~0#1_50| 4)) v_ArrVal_783))) (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| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))))) is different from false [2021-12-17 09:29:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2021-12-17 09:29:35,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954002256] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:29:35,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:29:35,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13] total 42 [2021-12-17 09:29:35,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862973546] [2021-12-17 09:29:35,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:29:35,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-17 09:29:35,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:29:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-17 09:29:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1262, Unknown=10, NotChecked=228, Total=1722 [2021-12-17 09:29:35,531 INFO L87 Difference]: Start difference. First operand 445 states and 580 transitions. Second operand has 42 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:37,749 WARN L838 $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|)) (.cse2 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (<= 3 .cse2) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int) (|v_ULTIMATE.start_main_~x~0#1_50| Int)) (or (<= 0 (select (let ((.cse3 (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_50| 4)) v_ArrVal_783))) (store .cse3 (+ (* (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| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))))) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= .cse2 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 20)) 4)))) is different from false [2021-12-17 09:29:38,249 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (<= 3 .cse1) (= (select .cse2 0) 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int) (|v_ULTIMATE.start_main_~x~0#1_50| Int)) (or (<= 0 (select (let ((.cse3 (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_50| 4)) v_ArrVal_783))) (store .cse3 (+ (* (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| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))))) (<= 0 (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= .cse1 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 20)) 4)))) is different from false [2021-12-17 09:29:38,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int) (|v_ULTIMATE.start_main_~x~0#1_50| Int)) (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (or (<= 0 (select (let ((.cse1 (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_50| 4)) v_ArrVal_783))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)))))) (= |c_ULTIMATE.start_main_~j~0#1| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (<= 3 .cse3) (= (select .cse4 0) 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (<= 0 (select .cse4 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= .cse3 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 20)) 4)))) is different from false [2021-12-17 09:29:40,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_ULTIMATE.start_main_~j~0#1|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~x~0#1_50| Int)) (or (forall ((v_ArrVal_784 Int) (v_ArrVal_783 Int)) (<= 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| (* |v_ULTIMATE.start_main_~x~0#1_50| 4)) v_ArrVal_783))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 4)) v_ArrVal_784)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_50| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (= |c_ULTIMATE.start_main_~j~0#1| 1) (<= .cse1 4) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) (= (select .cse2 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#Dest~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (<= 4 .cse1) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (<= 3 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (= (select .cse3 0) 0) (exists ((|ULTIMATE.start_main_~#Weight~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0#1.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |ULTIMATE.start_main_~#Weight~0#1.base|)))) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 28)) 4) (<= 0 (select .cse3 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse2 (+ (* |c_ULTIMATE.start_main_~j~0#1| 4) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 20)) 4))) is different from false [2021-12-17 09:29:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:29:41,507 INFO L93 Difference]: Finished difference Result 475 states and 613 transitions. [2021-12-17 09:29:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 09:29:41,507 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 09:29:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:29:41,508 INFO L225 Difference]: With dead ends: 475 [2021-12-17 09:29:41,509 INFO L226 Difference]: Without dead ends: 452 [2021-12-17 09:29:41,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=419, Invalid=2350, Unknown=15, NotChecked=756, Total=3540 [2021-12-17 09:29:41,510 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:29:41,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 235 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 121 Unchecked, 0.0s Time] [2021-12-17 09:29:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-12-17 09:29:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 445. [2021-12-17 09:29:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.3063063063063063) internal successors, (580), 444 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 580 transitions. [2021-12-17 09:29:41,541 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 580 transitions. Word has length 37 [2021-12-17 09:29:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:29:41,541 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 580 transitions. [2021-12-17 09:29:41,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 580 transitions. [2021-12-17 09:29:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:29:41,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:29:41,542 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:29:41,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 09:29:41,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:41,755 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:29:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:29:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash -607216299, now seen corresponding path program 2 times [2021-12-17 09:29:41,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:29:41,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733185717] [2021-12-17 09:29:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:41,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:29:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:29:42,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:29:42,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733185717] [2021-12-17 09:29:42,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733185717] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:29:42,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081030361] [2021-12-17 09:29:42,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:29:42,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:42,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:29:42,081 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) [2021-12-17 09:29:42,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 09:29:42,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:29:42,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:29:42,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-17 09:29:42,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:29:42,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:29:44,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:44,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:44,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:44,303 INFO L354 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2021-12-17 09:29:44,303 INFO L388 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 46 treesize of output 54 [2021-12-17 09:29:45,345 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:29:45,345 INFO L388 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 55 [2021-12-17 09:29:45,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-12-17 09:29:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 09:29:45,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:29:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 09:29:45,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081030361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:29:45,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:29:45,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2021-12-17 09:29:45,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438033118] [2021-12-17 09:29:45,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:29:45,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-17 09:29:45,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:29:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-17 09:29:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2021-12-17 09:29:45,924 INFO L87 Difference]: Start difference. First operand 445 states and 580 transitions. Second operand has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:29:51,308 INFO L93 Difference]: Finished difference Result 472 states and 609 transitions. [2021-12-17 09:29:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 09:29:51,326 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 09:29:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:29:51,328 INFO L225 Difference]: With dead ends: 472 [2021-12-17 09:29:51,328 INFO L226 Difference]: Without dead ends: 454 [2021-12-17 09:29:51,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2021-12-17 09:29:51,329 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:29:51,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 294 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 130 Unchecked, 0.0s Time] [2021-12-17 09:29:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-12-17 09:29:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 442. [2021-12-17 09:29:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.3061224489795917) internal successors, (576), 441 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 576 transitions. [2021-12-17 09:29:51,358 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 576 transitions. Word has length 37 [2021-12-17 09:29:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:29:51,358 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 576 transitions. [2021-12-17 09:29:51,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 576 transitions. [2021-12-17 09:29:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:29:51,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:29:51,359 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:29:51,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 09:29:51,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:51,562 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:29:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:29:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -251513984, now seen corresponding path program 1 times [2021-12-17 09:29:51,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:29:51,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76671214] [2021-12-17 09:29:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:51,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:29:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-17 09:29:51,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:29:51,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76671214] [2021-12-17 09:29:51,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76671214] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:29:51,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834081264] [2021-12-17 09:29:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:51,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:51,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:29:51,608 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:29:51,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 09:29:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:51,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 09:29:51,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:29:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:29:51,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:29:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:29:51,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834081264] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:29:51,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:29:51,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 18 [2021-12-17 09:29:51,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185592780] [2021-12-17 09:29:51,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:29:51,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 09:29:51,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:29:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 09:29:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-12-17 09:29:51,904 INFO L87 Difference]: Start difference. First operand 442 states and 576 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:29:52,556 INFO L93 Difference]: Finished difference Result 928 states and 1177 transitions. [2021-12-17 09:29:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-17 09:29:52,557 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-17 09:29:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:29:52,559 INFO L225 Difference]: With dead ends: 928 [2021-12-17 09:29:52,559 INFO L226 Difference]: Without dead ends: 879 [2021-12-17 09:29:52,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=490, Invalid=1862, Unknown=0, NotChecked=0, Total=2352 [2021-12-17 09:29:52,560 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 377 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:29:52,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 510 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 09:29:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-12-17 09:29:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 470. [2021-12-17 09:29:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.3113006396588487) internal successors, (615), 469 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 615 transitions. [2021-12-17 09:29:52,603 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 615 transitions. Word has length 37 [2021-12-17 09:29:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:29:52,603 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 615 transitions. [2021-12-17 09:29:52,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:29:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 615 transitions. [2021-12-17 09:29:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 09:29:52,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:29:52,604 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:29:52,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 09:29:52,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:52,824 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:29:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:29:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 783687490, now seen corresponding path program 5 times [2021-12-17 09:29:52,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:29:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934116659] [2021-12-17 09:29:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:52,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:29:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 09:29:53,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:29:53,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934116659] [2021-12-17 09:29:53,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934116659] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:29:53,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590275411] [2021-12-17 09:29:53,035 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 09:29:53,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:29:53,048 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:29:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 09:29:53,145 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-17 09:29:53,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:29:53,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-17 09:29:53,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:29:53,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 09:29:53,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:53,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:29:53,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:53,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:29:53,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:29:53,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:29:53,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:29:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 09:29:53,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:29:55,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int)) (or (forall ((v_ArrVal_925 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 09:30:00,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int) (v_ArrVal_925 Int) (v_ArrVal_923 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |v_ULTIMATE.start_main_~i~0#1_221| 1)) (<= 0 (select (store (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_221| 4)) v_ArrVal_923) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_221| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 09:30:02,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_925 Int) (v_ArrVal_923 Int) (v_ArrVal_922 Int)) (or (<= 0 (select (store (store (store (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|) v_ArrVal_922) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_221| 4)) v_ArrVal_923) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |v_ULTIMATE.start_main_~i~0#1_221| 1)) (< |v_ULTIMATE.start_main_~i~0#1_221| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 09:30:04,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_222| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_222| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_925 Int) (v_ArrVal_923 Int) (v_ArrVal_922 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_221| (+ |v_ULTIMATE.start_main_~i~0#1_222| 1)) (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |v_ULTIMATE.start_main_~i~0#1_221| 1)) (<= 0 (select (store (store (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_222| 4)) v_ArrVal_922) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_221| 4)) v_ArrVal_923) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) is different from false [2021-12-17 09:30:04,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-12-17 09:30:04,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1334 treesize of output 1326 [2021-12-17 09:30:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2021-12-17 09:30:05,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590275411] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:30:05,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:30:05,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 12] total 29 [2021-12-17 09:30:05,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388443434] [2021-12-17 09:30:05,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:30:05,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-17 09:30:05,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:30:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-17 09:30:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=468, Unknown=11, NotChecked=196, Total=812 [2021-12-17 09:30:05,613 INFO L87 Difference]: Start difference. First operand 470 states and 615 transitions. Second operand has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 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) [2021-12-17 09:30:07,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_222| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_222| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_925 Int) (v_ArrVal_923 Int) (v_ArrVal_922 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_221| (+ |v_ULTIMATE.start_main_~i~0#1_222| 1)) (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |v_ULTIMATE.start_main_~i~0#1_221| 1)) (<= 0 (select (store (store (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_222| 4)) v_ArrVal_922) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_221| 4)) v_ArrVal_923) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~#distance~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) (<= 899 c_~INFINITY~0) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2021-12-17 09:30:09,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (<= 0 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int)) (or (forall ((v_ArrVal_925 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int) (v_ArrVal_925 Int) (v_ArrVal_923 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |v_ULTIMATE.start_main_~i~0#1_221| 1)) (<= 0 (select (store (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_221| 4)) v_ArrVal_923) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_221| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 899 c_~INFINITY~0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 09:30:11,702 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (<= 0 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_220| Int)) (or (forall ((v_ArrVal_925 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_220| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_925) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_220| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse0 0) 0) (= 0 |c_ULTIMATE.start_main_~#distance~0#1.offset|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 899 c_~INFINITY~0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 09:30:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:30:12,032 INFO L93 Difference]: Finished difference Result 581 states and 745 transitions. [2021-12-17 09:30:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 09:30:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 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 37 [2021-12-17 09:30:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:30:12,034 INFO L225 Difference]: With dead ends: 581 [2021-12-17 09:30:12,034 INFO L226 Difference]: Without dead ends: 579 [2021-12-17 09:30:12,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=288, Invalid=916, Unknown=14, NotChecked=504, Total=1722 [2021-12-17 09:30:12,035 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 153 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:30:12,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 362 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 502 Invalid, 0 Unknown, 472 Unchecked, 0.2s Time] [2021-12-17 09:30:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-12-17 09:30:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2021-12-17 09:30:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.305699481865285) internal successors, (504), 386 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:30:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 504 transitions. [2021-12-17 09:30:12,070 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 504 transitions. Word has length 37 [2021-12-17 09:30:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:30:12,070 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 504 transitions. [2021-12-17 09:30:12,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 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) [2021-12-17 09:30:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 504 transitions. [2021-12-17 09:30:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:30:12,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:30:12,071 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:30:12,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-17 09:30:12,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-17 09:30:12,289 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:30:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:30:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2021-12-17 09:30:12,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:30:12,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551519843] [2021-12-17 09:30:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:30:12,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:30:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:30:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:30:13,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:30:13,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551519843] [2021-12-17 09:30:13,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551519843] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:30:13,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828223186] [2021-12-17 09:30:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:30:13,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:30:13,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:30:13,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:30:13,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 09:30:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:30:13,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-17 09:30:13,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:30:13,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-17 09:30:13,708 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:30:13,709 INFO L388 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 [2021-12-17 09:30:13,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:30:13,861 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:30:13,861 INFO L388 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 44 treesize of output 52 [2021-12-17 09:30:14,087 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-17 09:30:14,088 INFO L388 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 [2021-12-17 09:30:14,357 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:30:14,357 INFO L388 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 [2021-12-17 09:30:14,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:30:14,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:30:14,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:30:14,362 INFO L388 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 [2021-12-17 09:30:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:30:14,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:30:24,195 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_233| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_233| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_984 Int) (v_ArrVal_982 Int)) (or (< 0 (+ v_ArrVal_984 1)) (let ((.cse0 (let ((.cse2 (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_233| 4)) v_ArrVal_982))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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|) 4)) v_ArrVal_984)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))))))))))) is different from false [2021-12-17 09:30:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 2 times theorem prover too weak. 3 trivial. 1 not checked. [2021-12-17 09:30:36,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828223186] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:30:36,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:30:36,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-17 09:30:36,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609147071] [2021-12-17 09:30:36,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:30:36,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-17 09:30:36,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:30:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-17 09:30:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=620, Unknown=11, NotChecked=52, Total=812 [2021-12-17 09:30:36,388 INFO L87 Difference]: Start difference. First operand 387 states and 504 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) [2021-12-17 09:30:38,437 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#Weight~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (= (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) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) (<= 0 |c_ULTIMATE.start_main_~#Source~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~i~0#1_233| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_233| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_984 Int) (v_ArrVal_982 Int)) (or (< 0 (+ v_ArrVal_984 1)) (let ((.cse0 (let ((.cse2 (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_233| 4)) v_ArrVal_982))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (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|) 4)) v_ArrVal_984)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))))))))))) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~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) (not (= |c_ULTIMATE.start_main_~#Source~0#1.base| |c_ULTIMATE.start_main_~#distance~0#1.base|))) is different from false [2021-12-17 09:30:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:30:39,751 INFO L93 Difference]: Finished difference Result 875 states and 1131 transitions. [2021-12-17 09:30:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-17 09:30:39,751 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 [2021-12-17 09:30:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:30:39,753 INFO L225 Difference]: With dead ends: 875 [2021-12-17 09:30:39,753 INFO L226 Difference]: Without dead ends: 736 [2021-12-17 09:30:39,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=530, Invalid=2016, Unknown=12, NotChecked=198, Total=2756 [2021-12-17 09:30:39,754 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 243 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:30:39,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 519 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 509 Invalid, 0 Unknown, 347 Unchecked, 0.4s Time] [2021-12-17 09:30:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-12-17 09:30:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 544. [2021-12-17 09:30:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.3075506445672191) internal successors, (710), 543 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:30:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 710 transitions. [2021-12-17 09:30:39,807 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 710 transitions. Word has length 38 [2021-12-17 09:30:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:30:39,807 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 710 transitions. [2021-12-17 09:30:39,807 INFO L471 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) [2021-12-17 09:30:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 710 transitions. [2021-12-17 09:30:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:30:39,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:30:39,809 INFO L514 BasicCegarLoop]: 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] [2021-12-17 09:30:39,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-17 09:30:40,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-17 09:30:40,024 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:30:40,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:30:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2021-12-17 09:30:40,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:30:40,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822345242] [2021-12-17 09:30:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:30:40,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:30:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 09:30:40,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 09:30:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 09:30:40,088 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 09:30:40,089 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 09:30:40,089 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 09:30:40,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-17 09:30:40,092 INFO L732 BasicCegarLoop]: Path program histogram: [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:30:40,094 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 09:30:40,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:30:40 BoogieIcfgContainer [2021-12-17 09:30:40,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 09:30:40,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 09:30:40,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 09:30:40,149 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 09:30:40,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:27:22" (3/4) ... [2021-12-17 09:30:40,151 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 09:30:40,191 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 09:30:40,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 09:30:40,192 INFO L158 Benchmark]: Toolchain (without parser) took 198565.18ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 90.4MB in the beginning and 80.4MB in the end (delta: 10.0MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,192 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:30:40,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.05ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 94.9MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.75ms. Allocated memory is still 121.6MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,193 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 121.6MB. Free memory was 92.7MB in the beginning and 91.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,193 INFO L158 Benchmark]: RCFGBuilder took 283.47ms. Allocated memory is still 121.6MB. Free memory was 91.2MB in the beginning and 77.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,193 INFO L158 Benchmark]: TraceAbstraction took 197868.57ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 76.5MB in the beginning and 85.7MB in the end (delta: -9.1MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,193 INFO L158 Benchmark]: Witness Printer took 42.69ms. Allocated memory is still 180.4MB. Free memory was 85.7MB in the beginning and 80.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 09:30:40,198 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.15ms. Allocated memory is still 81.8MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.05ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 94.9MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.75ms. Allocated memory is still 121.6MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 121.6MB. Free memory was 92.7MB in the beginning and 91.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.47ms. Allocated memory is still 121.6MB. Free memory was 91.2MB in the beginning and 77.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 197868.57ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 76.5MB in the beginning and 85.7MB in the end (delta: -9.1MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 42.69ms. Allocated memory is still 180.4MB. Free memory was 85.7MB in the beginning and 80.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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={25:0}, source=0, Weight={21:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={25:0}, Weight={21: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={25:0}, source=0, Weight={21:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={25:0}, source=0, Weight={21:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={25:0}, Weight={21: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={25:0}, source=0, Weight={21:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={25:0}, source=0, Weight={21:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={25:0}, Weight={21:0}] [L39] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={25:0}, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, source=0, Weight={21: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=0, Source={25:0}, Weight={21: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=0, Source={25:0}, Weight={21: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={25:0}, Weight={21: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={25:0}, Weight={21: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={25:0}, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, Weight={21: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=0, Source={25:0}, Weight={21: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=0, Source={25:0}, Weight={21: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=0, Source={25:0}, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, source=0, Weight={21: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={25:0}, source=0, Weight={21: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: 197.8s, OverallIterations: 25, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3650 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3650 mSDsluCounter, 5979 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2849 IncrementalHoareTripleChecker+Unchecked, 5105 mSDsCounter, 1327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5788 IncrementalHoareTripleChecker+Invalid, 9964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1327 mSolverCounterUnsat, 874 mSDtfsCounter, 5788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1835 GetRequests, 1052 SyntacticMatches, 52 SemanticMatches, 731 ConstructedPredicates, 50 IntricatePredicates, 1 DeprecatedPredicates, 8413 ImplicationChecksByTransitivity, 171.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=24, InterpolantAutomatonStates: 441, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 2418 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 143.5s InterpolantComputationTime, 1383 NumberOfCodeBlocks, 1377 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1920 ConstructedInterpolants, 268 QuantifiedInterpolants, 29113 SizeOfPredicates, 230 NumberOfNonLiveVariables, 5727 ConjunctsInSsa, 562 ConjunctsInUnsatCore, 66 InterpolantComputations, 3 PerfectInterpolantSequences, 436/1071 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 09:30:40,277 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