./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:47:37,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:47:37,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:47:37,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:47:37,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:47:37,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:47:37,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:47:37,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:47:37,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:47:37,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:47:37,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:47:37,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:47:37,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:47:37,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:47:37,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:47:37,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:47:37,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:47:37,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:47:37,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:47:37,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:47:37,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:47:37,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:47:37,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:47:37,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:47:37,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:47:37,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:47:37,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:47:37,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:47:37,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:47:37,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:47:37,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:47:37,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:47:37,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:47:37,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:47:37,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:47:37,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:47:37,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:47:37,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:47:37,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:47:37,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:47:37,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:47:37,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:47:37,576 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:47:37,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:47:37,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:47:37,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:47:37,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:47:37,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:47:37,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:47:37,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:47:37,579 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:47:37,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:47:37,580 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:47:37,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:47:37,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:47:37,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:47:37,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:47:37,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:47:37,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:47:37,582 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:47:37,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:47:37,582 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:47:37,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:47:37,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:47:37,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:47:37,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:47:37,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:47:37,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:47:37,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:47:37,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:47:37,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:47:37,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:47:37,584 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:47:37,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:47:37,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:47:37,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:47:37,585 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-15 10:47:37,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:47:37,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:47:37,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:47:37,859 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:47:37,859 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:47:37,860 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-15 10:47:37,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10207e1cf/7f7fc08cf14f45d7aefb5452a801731f/FLAG3d10a2cac [2021-12-15 10:47:38,290 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:47:38,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2021-12-15 10:47:38,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10207e1cf/7f7fc08cf14f45d7aefb5452a801731f/FLAG3d10a2cac [2021-12-15 10:47:38,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10207e1cf/7f7fc08cf14f45d7aefb5452a801731f [2021-12-15 10:47:38,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:47:38,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:47:38,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:47:38,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:47:38,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:47:38,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c240bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38, skipping insertion in model container [2021-12-15 10:47:38,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:47:38,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:47:38,447 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-15 10:47:38,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:47:38,475 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:47:38,485 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-15 10:47:38,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:47:38,519 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:47:38,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38 WrapperNode [2021-12-15 10:47:38,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:47:38,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:47:38,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:47:38,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:47:38,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,563 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2021-12-15 10:47:38,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:47:38,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:47:38,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:47:38,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:47:38,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:47:38,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:47:38,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:47:38,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:47:38,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (1/1) ... [2021-12-15 10:47:38,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:47:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:38,633 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-15 10:47:38,639 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-15 10:47:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:47:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:47:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 10:47:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 10:47:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:47:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:47:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 10:47:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:47:38,731 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:47:38,735 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:47:38,987 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:47:38,992 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:47:38,992 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 10:47:38,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:47:38 BoogieIcfgContainer [2021-12-15 10:47:38,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:47:38,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:47:38,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:47:39,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:47:39,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:47:38" (1/3) ... [2021-12-15 10:47:39,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a32abdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:47:39, skipping insertion in model container [2021-12-15 10:47:39,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:38" (2/3) ... [2021-12-15 10:47:39,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a32abdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:47:39, skipping insertion in model container [2021-12-15 10:47:39,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:47:38" (3/3) ... [2021-12-15 10:47:39,003 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2021-12-15 10:47:39,008 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:47:39,008 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 10:47:39,052 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:47:39,057 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-15 10:47:39,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 10:47:39,066 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-15 10:47:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 10:47:39,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:39,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:39,072 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2021-12-15 10:47:39,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:39,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566552386] [2021-12-15 10:47:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:39,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:39,377 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-15 10:47:39,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566552386] [2021-12-15 10:47:39,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566552386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:39,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:39,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:47:39,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367359895] [2021-12-15 10:47:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:39,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:47:39,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:47:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:47:39,416 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-15 10:47:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:39,516 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2021-12-15 10:47:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 10:47:39,520 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-15 10:47:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:39,526 INFO L225 Difference]: With dead ends: 89 [2021-12-15 10:47:39,526 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 10:47:39,529 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-15 10:47:39,531 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:39,532 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.1s Time] [2021-12-15 10:47:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 10:47:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-12-15 10:47:39,557 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-15 10:47:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-15 10:47:39,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2021-12-15 10:47:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:39,559 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-15 10:47:39,559 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-15 10:47:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-15 10:47:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 10:47:39,560 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:39,560 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-15 10:47:39,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:47:39,561 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:39,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2021-12-15 10:47:39,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:39,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246935274] [2021-12-15 10:47:39,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:39,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:39,759 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-15 10:47:39,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:39,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246935274] [2021-12-15 10:47:39,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246935274] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:39,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211597273] [2021-12-15 10:47:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:39,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:39,763 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-15 10:47:39,764 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-15 10:47:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:39,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 10:47:39,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:39,934 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-15 10:47:40,081 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-15 10:47:40,115 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-15 10:47:40,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:40,210 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-15 10:47:40,214 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-15 10:47:40,231 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-15 10:47:40,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211597273] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:40,232 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:40,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-15 10:47:40,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548603661] [2021-12-15 10:47:40,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:40,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 10:47:40,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 10:47:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-15 10:47:40,235 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-15 10:47:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:40,450 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2021-12-15 10:47:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 10:47:40,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-15 10:47:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:40,452 INFO L225 Difference]: With dead ends: 84 [2021-12-15 10:47:40,453 INFO L226 Difference]: Without dead ends: 82 [2021-12-15 10:47:40,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-15 10:47:40,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.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:40,455 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.2s Time] [2021-12-15 10:47:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-15 10:47:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2021-12-15 10:47:40,464 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-15 10:47:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2021-12-15 10:47:40,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2021-12-15 10:47:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:40,467 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2021-12-15 10:47:40,467 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-15 10:47:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2021-12-15 10:47:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 10:47:40,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:40,468 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-15 10:47:40,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 10:47:40,690 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-15 10:47:40,691 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2021-12-15 10:47:40,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268397090] [2021-12-15 10:47:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:40,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:40,740 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-15 10:47:40,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:40,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268397090] [2021-12-15 10:47:40,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268397090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:40,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:40,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:47:40,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5773646] [2021-12-15 10:47:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:40,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:47:40,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:47:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:47:40,743 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-15 10:47:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:40,766 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-12-15 10:47:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:47:40,766 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-15 10:47:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:40,767 INFO L225 Difference]: With dead ends: 66 [2021-12-15 10:47:40,767 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 10:47:40,767 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-15 10:47:40,770 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-15 10:47:40,771 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-15 10:47:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 10:47:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-12-15 10:47:40,783 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-15 10:47:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2021-12-15 10:47:40,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2021-12-15 10:47:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:40,794 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2021-12-15 10:47:40,794 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-15 10:47:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2021-12-15 10:47:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 10:47:40,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:40,795 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-15 10:47:40,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 10:47:40,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2021-12-15 10:47:40,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:40,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407916994] [2021-12-15 10:47:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:40,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:40,861 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-15 10:47:40,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407916994] [2021-12-15 10:47:40,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407916994] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187247503] [2021-12-15 10:47:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:40,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:40,864 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-15 10:47:40,865 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-15 10:47:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:40,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 10:47:40,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:40,998 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-15 10:47:40,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:41,039 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-15 10:47:41,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187247503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:41,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:41,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-15 10:47:41,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38109216] [2021-12-15 10:47:41,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:41,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 10:47:41,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 10:47:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-15 10:47:41,042 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-15 10:47:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:41,156 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2021-12-15 10:47:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 10:47:41,156 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-15 10:47:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:41,160 INFO L225 Difference]: With dead ends: 114 [2021-12-15 10:47:41,160 INFO L226 Difference]: Without dead ends: 86 [2021-12-15 10:47:41,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:47:41,164 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-15 10:47:41,166 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-15 10:47:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-15 10:47:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2021-12-15 10:47:41,177 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-15 10:47:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2021-12-15 10:47:41,178 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2021-12-15 10:47:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:41,178 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2021-12-15 10:47:41,178 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-15 10:47:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2021-12-15 10:47:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 10:47:41,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:41,179 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-15 10:47:41,207 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-15 10:47:41,401 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-15 10:47:41,402 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2021-12-15 10:47:41,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:41,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927241406] [2021-12-15 10:47:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:41,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:41,456 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-15 10:47:41,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927241406] [2021-12-15 10:47:41,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927241406] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793560298] [2021-12-15 10:47:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:41,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:41,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:41,459 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-15 10:47:41,461 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-15 10:47:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:41,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 10:47:41,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:41,603 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-15 10:47:41,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:41,659 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-15 10:47:41,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793560298] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:41,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:41,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 10:47:41,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016259984] [2021-12-15 10:47:41,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:41,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 10:47:41,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:41,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 10:47:41,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 10:47:41,663 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-15 10:47:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:41,842 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2021-12-15 10:47:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:47:41,842 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-15 10:47:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:41,843 INFO L225 Difference]: With dead ends: 181 [2021-12-15 10:47:41,844 INFO L226 Difference]: Without dead ends: 159 [2021-12-15 10:47:41,844 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-15 10:47:41,845 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-15 10:47:41,845 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-15 10:47:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-15 10:47:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2021-12-15 10:47:41,852 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-15 10:47:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2021-12-15 10:47:41,853 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2021-12-15 10:47:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:41,853 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-12-15 10:47:41,853 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-15 10:47:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2021-12-15 10:47:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 10:47:41,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:41,855 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-15 10:47:41,876 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-15 10:47:42,067 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-15 10:47:42,067 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2021-12-15 10:47:42,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743605847] [2021-12-15 10:47:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:42,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:42,137 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-15 10:47:42,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:42,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743605847] [2021-12-15 10:47:42,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743605847] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:42,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228569536] [2021-12-15 10:47:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:42,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:42,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:42,140 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-15 10:47:42,141 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-15 10:47:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:42,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 10:47:42,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:42,282 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-15 10:47:42,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:42,325 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-15 10:47:42,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228569536] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:42,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:42,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 10:47:42,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773353738] [2021-12-15 10:47:42,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:42,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 10:47:42,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:42,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 10:47:42,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 10:47:42,328 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-15 10:47:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:42,459 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2021-12-15 10:47:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:47:42,459 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-15 10:47:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:42,460 INFO L225 Difference]: With dead ends: 206 [2021-12-15 10:47:42,460 INFO L226 Difference]: Without dead ends: 146 [2021-12-15 10:47:42,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:47:42,462 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-15 10:47:42,463 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-15 10:47:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-15 10:47:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2021-12-15 10:47:42,480 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-15 10:47:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2021-12-15 10:47:42,482 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2021-12-15 10:47:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:42,482 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-12-15 10:47:42,482 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-15 10:47:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2021-12-15 10:47:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 10:47:42,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:42,483 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-15 10:47:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:42,706 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-15 10:47:42,706 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2021-12-15 10:47:42,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:42,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060565761] [2021-12-15 10:47:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:42,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:43,098 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-15 10:47:43,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060565761] [2021-12-15 10:47:43,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060565761] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452352323] [2021-12-15 10:47:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:43,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:43,102 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-15 10:47:43,113 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-15 10:47:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:43,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 10:47:43,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:43,204 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-15 10:47:43,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 19 treesize of output 18 [2021-12-15 10:47:43,370 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 10:47:43,371 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-15 10:47:43,563 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-15 10:47:43,582 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-15 10:47:43,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:43,802 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-15 10:47:43,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452352323] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:43,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:43,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2021-12-15 10:47:43,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763333045] [2021-12-15 10:47:43,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:43,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 10:47:43,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 10:47:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-12-15 10:47:43,805 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-15 10:47:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:44,286 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2021-12-15 10:47:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 10:47:44,286 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-15 10:47:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:44,288 INFO L225 Difference]: With dead ends: 190 [2021-12-15 10:47:44,288 INFO L226 Difference]: Without dead ends: 176 [2021-12-15 10:47:44,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2021-12-15 10:47:44,290 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-15 10:47:44,290 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-15 10:47:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-15 10:47:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 96. [2021-12-15 10:47:44,298 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-15 10:47:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2021-12-15 10:47:44,298 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 25 [2021-12-15 10:47:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:44,299 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2021-12-15 10:47:44,299 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-15 10:47:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2021-12-15 10:47:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 10:47:44,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:44,300 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-15 10:47:44,323 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-15 10:47:44,513 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-15 10:47:44,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2021-12-15 10:47:44,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:44,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924853943] [2021-12-15 10:47:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:44,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:44,605 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-15 10:47:44,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:44,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924853943] [2021-12-15 10:47:44,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924853943] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:44,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050481046] [2021-12-15 10:47:44,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:47:44,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:44,607 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-15 10:47:44,614 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-15 10:47:44,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:47:44,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:47:44,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 10:47:44,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:44,707 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-15 10:47:44,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:44,746 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-15 10:47:44,823 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-15 10:47:44,838 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-15 10:47:44,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:46,940 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-15 10:47:46,974 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-15 10:47:46,978 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-15 10:47:47,050 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-15 10:47:47,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050481046] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:47,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:47,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2021-12-15 10:47:47,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521176514] [2021-12-15 10:47:47,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:47,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 10:47:47,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 10:47:47,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2021-12-15 10:47:47,053 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-15 10:47:49,069 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-15 10:47:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:49,267 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2021-12-15 10:47:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 10:47:49,267 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-15 10:47:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:49,268 INFO L225 Difference]: With dead ends: 214 [2021-12-15 10:47:49,269 INFO L226 Difference]: Without dead ends: 212 [2021-12-15 10:47:49,269 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-15 10:47:49,270 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-15 10:47:49,270 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-15 10:47:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-15 10:47:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2021-12-15 10:47:49,278 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-15 10:47:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2021-12-15 10:47:49,279 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 25 [2021-12-15 10:47:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:49,279 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2021-12-15 10:47:49,279 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-15 10:47:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2021-12-15 10:47:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 10:47:49,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:49,281 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-15 10:47:49,306 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-15 10:47:49,504 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-15 10:47:49,504 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2021-12-15 10:47:49,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:49,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522287648] [2021-12-15 10:47:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:49,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:49,587 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-15 10:47:49,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:49,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522287648] [2021-12-15 10:47:49,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522287648] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:49,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389242654] [2021-12-15 10:47:49,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:47:49,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:49,589 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-15 10:47:49,591 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-15 10:47:49,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:47:49,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:47:49,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 10:47:49,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:49,746 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-15 10:47:49,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:49,794 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-15 10:47:49,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389242654] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:49,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:49,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 10:47:49,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868555105] [2021-12-15 10:47:49,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:49,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 10:47:49,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:49,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 10:47:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-15 10:47:49,797 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-15 10:47:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:49,939 INFO L93 Difference]: Finished difference Result 234 states and 298 transitions. [2021-12-15 10:47:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 10:47:49,940 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-15 10:47:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:49,941 INFO L225 Difference]: With dead ends: 234 [2021-12-15 10:47:49,941 INFO L226 Difference]: Without dead ends: 221 [2021-12-15 10:47:49,941 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-15 10:47:49,942 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-15 10:47:49,942 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-15 10:47:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-15 10:47:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2021-12-15 10:47:49,952 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-15 10:47:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2021-12-15 10:47:49,953 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 28 [2021-12-15 10:47:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:49,953 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2021-12-15 10:47:49,954 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-15 10:47:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2021-12-15 10:47:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 10:47:49,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:49,955 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-15 10:47:49,980 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-15 10:47:50,177 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-15 10:47:50,178 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -483995622, now seen corresponding path program 3 times [2021-12-15 10:47:50,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:50,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986669816] [2021-12-15 10:47:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:50,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:50,229 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-15 10:47:50,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986669816] [2021-12-15 10:47:50,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986669816] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871116939] [2021-12-15 10:47:50,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 10:47:50,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:50,231 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-15 10:47:50,233 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-15 10:47:50,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 10:47:50,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:47:50,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 10:47:50,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:50,410 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-15 10:47:50,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:50,472 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-15 10:47:50,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871116939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:50,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:50,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 14 [2021-12-15 10:47:50,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105712685] [2021-12-15 10:47:50,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:50,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 10:47:50,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 10:47:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-15 10:47:50,474 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-15 10:47:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:50,777 INFO L93 Difference]: Finished difference Result 419 states and 547 transitions. [2021-12-15 10:47:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 10:47:50,778 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-15 10:47:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:50,779 INFO L225 Difference]: With dead ends: 419 [2021-12-15 10:47:50,779 INFO L226 Difference]: Without dead ends: 289 [2021-12-15 10:47:50,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-12-15 10:47:50,781 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.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:50,781 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.2s Time] [2021-12-15 10:47:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-15 10:47:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 142. [2021-12-15 10:47:50,793 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-15 10:47:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2021-12-15 10:47:50,794 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 28 [2021-12-15 10:47:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:50,794 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2021-12-15 10:47:50,795 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-15 10:47:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2021-12-15 10:47:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 10:47:50,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:50,797 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-15 10:47:50,821 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-15 10:47:51,021 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-15 10:47:51,022 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2021-12-15 10:47:51,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:51,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035355395] [2021-12-15 10:47:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:51,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:51,189 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-15 10:47:51,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035355395] [2021-12-15 10:47:51,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035355395] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453265494] [2021-12-15 10:47:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:51,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:51,192 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-15 10:47:51,193 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-15 10:47:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:51,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 10:47:51,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:51,314 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-15 10:47:51,407 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-15 10:47:51,425 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-15 10:47:51,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:51,513 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-15 10:47:51,515 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-15 10:47:51,587 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-15 10:47:51,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453265494] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:51,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:51,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-15 10:47:51,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716991451] [2021-12-15 10:47:51,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:51,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 10:47:51,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:51,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 10:47:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-15 10:47:51,589 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-15 10:47:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:52,010 INFO L93 Difference]: Finished difference Result 274 states and 346 transitions. [2021-12-15 10:47:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 10:47:52,010 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-15 10:47:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:52,011 INFO L225 Difference]: With dead ends: 274 [2021-12-15 10:47:52,012 INFO L226 Difference]: Without dead ends: 272 [2021-12-15 10:47:52,012 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-15 10:47:52,013 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 209 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:52,013 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.2s Time] [2021-12-15 10:47:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-15 10:47:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 191. [2021-12-15 10:47:52,024 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-15 10:47:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2021-12-15 10:47:52,025 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 29 [2021-12-15 10:47:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:52,025 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2021-12-15 10:47:52,025 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-15 10:47:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2021-12-15 10:47:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 10:47:52,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:52,026 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-15 10:47:52,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:52,245 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-15 10:47:52,245 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2021-12-15 10:47:52,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:52,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235828410] [2021-12-15 10:47:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:52,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:52,710 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-15 10:47:52,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:52,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235828410] [2021-12-15 10:47:52,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235828410] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:52,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470645123] [2021-12-15 10:47:52,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 10:47:52,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:52,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:52,713 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-15 10:47:52,734 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-15 10:47:52,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 10:47:52,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:47:52,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-15 10:47:52,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:52,853 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-15 10:47:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:52,902 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-15 10:47:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:53,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:47:53,078 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 10:47:53,079 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-15 10:47:53,190 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 10:47:53,191 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-15 10:47:53,449 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-15 10:47:53,475 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-15 10:47:53,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:57,182 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-15 10:47:58,288 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-15 10:48:00,357 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-15 10:48:00,406 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-15 10:48:00,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470645123] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:48:00,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:48:00,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2021-12-15 10:48:00,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291203504] [2021-12-15 10:48:00,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:00,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 10:48:00,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 10:48:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=673, Unknown=5, NotChecked=168, Total=992 [2021-12-15 10:48:00,408 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-15 10:48:00,946 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-15 10:48:01,393 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-15 10:48:03,399 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-15 10:48:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:03,699 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2021-12-15 10:48:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 10:48:03,700 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-15 10:48:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:03,702 INFO L225 Difference]: With dead ends: 230 [2021-12-15 10:48:03,702 INFO L226 Difference]: Without dead ends: 203 [2021-12-15 10:48:03,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=229, Invalid=977, Unknown=8, NotChecked=426, Total=1640 [2021-12-15 10:48:03,704 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-15 10:48:03,704 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-15 10:48:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-15 10:48:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2021-12-15 10:48:03,718 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-15 10:48:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2021-12-15 10:48:03,718 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 31 [2021-12-15 10:48:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:03,719 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2021-12-15 10:48:03,719 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-15 10:48:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2021-12-15 10:48:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 10:48:03,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:03,720 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-15 10:48:03,745 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-15 10:48:03,944 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-15 10:48:03,945 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2021-12-15 10:48:03,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:03,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379934231] [2021-12-15 10:48:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:03,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:03,991 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-15 10:48:03,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:03,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379934231] [2021-12-15 10:48:03,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379934231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:48:03,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:48:03,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:48:03,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324946129] [2021-12-15 10:48:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:48:03,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:48:03,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:48:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:48:03,993 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-15 10:48:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:04,024 INFO L93 Difference]: Finished difference Result 325 states and 419 transitions. [2021-12-15 10:48:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:48:04,024 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-15 10:48:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:04,026 INFO L225 Difference]: With dead ends: 325 [2021-12-15 10:48:04,026 INFO L226 Difference]: Without dead ends: 226 [2021-12-15 10:48:04,026 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-15 10:48:04,027 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-15 10:48:04,027 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-15 10:48:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-15 10:48:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2021-12-15 10:48:04,039 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-15 10:48:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 248 transitions. [2021-12-15 10:48:04,040 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 248 transitions. Word has length 31 [2021-12-15 10:48:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:04,040 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 248 transitions. [2021-12-15 10:48:04,041 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-15 10:48:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 248 transitions. [2021-12-15 10:48:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 10:48:04,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:04,042 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-15 10:48:04,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 10:48:04,042 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash 810953566, now seen corresponding path program 4 times [2021-12-15 10:48:04,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49662830] [2021-12-15 10:48:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:04,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:04,205 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-15 10:48:04,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:04,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49662830] [2021-12-15 10:48:04,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49662830] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:04,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664101123] [2021-12-15 10:48:04,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 10:48:04,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:04,208 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-15 10:48:04,209 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-15 10:48:04,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 10:48:04,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:48:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 10:48:04,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:48:04,273 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-15 10:48:04,305 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-15 10:48:04,306 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-15 10:48:04,354 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-15 10:48:04,354 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-15 10:48:04,732 INFO L354 Elim1Store]: treesize reduction 10, result has 23.1 percent of original size [2021-12-15 10:48:04,733 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-15 10:48:04,757 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-15 10:48:04,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:48:05,286 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-15 10:48:05,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664101123] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:48:05,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:48:05,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 35 [2021-12-15 10:48:05,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164385862] [2021-12-15 10:48:05,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:05,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-15 10:48:05,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 10:48:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 10:48:05,289 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-15 10:48:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:07,847 INFO L93 Difference]: Finished difference Result 653 states and 830 transitions. [2021-12-15 10:48:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-12-15 10:48:07,848 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-15 10:48:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:07,850 INFO L225 Difference]: With dead ends: 653 [2021-12-15 10:48:07,850 INFO L226 Difference]: Without dead ends: 651 [2021-12-15 10:48:07,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1919, Invalid=6822, Unknown=1, NotChecked=0, Total=8742 [2021-12-15 10:48:07,853 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 669 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-15 10:48:07,853 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.6s Time] [2021-12-15 10:48:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-15 10:48:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 234. [2021-12-15 10:48:07,875 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-15 10:48:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 299 transitions. [2021-12-15 10:48:07,876 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 299 transitions. Word has length 31 [2021-12-15 10:48:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:07,876 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 299 transitions. [2021-12-15 10:48:07,876 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-15 10:48:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 299 transitions. [2021-12-15 10:48:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 10:48:07,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:07,877 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-15 10:48:07,894 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-15 10:48:08,083 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-15 10:48:08,083 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2021-12-15 10:48:08,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:08,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089831425] [2021-12-15 10:48:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:08,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:08,142 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-15 10:48:08,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089831425] [2021-12-15 10:48:08,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089831425] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:08,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309796730] [2021-12-15 10:48:08,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:48:08,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:08,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:08,144 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-15 10:48:08,145 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-15 10:48:08,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:48:08,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:48:08,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 10:48:08,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:48:08,319 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-15 10:48:08,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:48:08,376 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-15 10:48:08,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309796730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:48:08,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:48:08,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 10:48:08,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171998251] [2021-12-15 10:48:08,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:08,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 10:48:08,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 10:48:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 10:48:08,378 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-15 10:48:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:08,596 INFO L93 Difference]: Finished difference Result 501 states and 629 transitions. [2021-12-15 10:48:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 10:48:08,597 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-15 10:48:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:08,598 INFO L225 Difference]: With dead ends: 501 [2021-12-15 10:48:08,598 INFO L226 Difference]: Without dead ends: 399 [2021-12-15 10:48:08,598 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-15 10:48:08,599 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-15 10:48:08,599 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-15 10:48:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-12-15 10:48:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 284. [2021-12-15 10:48:08,622 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-15 10:48:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 363 transitions. [2021-12-15 10:48:08,623 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 363 transitions. Word has length 33 [2021-12-15 10:48:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:08,623 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 363 transitions. [2021-12-15 10:48:08,623 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-15 10:48:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 363 transitions. [2021-12-15 10:48:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 10:48:08,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:08,624 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-15 10:48:08,643 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-15 10:48:08,826 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-15 10:48:08,826 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2021-12-15 10:48:08,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:08,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740816533] [2021-12-15 10:48:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:08,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:08,889 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-15 10:48:08,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:08,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740816533] [2021-12-15 10:48:08,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740816533] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:08,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525579912] [2021-12-15 10:48:08,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 10:48:08,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:08,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:08,891 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-15 10:48:08,921 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-15 10:48:08,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 10:48:08,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:48:08,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 10:48:08,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:48:09,084 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-15 10:48:09,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:48:09,142 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-15 10:48:09,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525579912] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:48:09,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:48:09,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 10:48:09,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62890391] [2021-12-15 10:48:09,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:09,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 10:48:09,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 10:48:09,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 10:48:09,144 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-15 10:48:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:09,331 INFO L93 Difference]: Finished difference Result 640 states and 810 transitions. [2021-12-15 10:48:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 10:48:09,331 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-15 10:48:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:09,333 INFO L225 Difference]: With dead ends: 640 [2021-12-15 10:48:09,333 INFO L226 Difference]: Without dead ends: 615 [2021-12-15 10:48:09,334 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-15 10:48:09,334 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-15 10:48:09,334 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-15 10:48:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-15 10:48:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 396. [2021-12-15 10:48:09,363 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-15 10:48:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 518 transitions. [2021-12-15 10:48:09,364 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 518 transitions. Word has length 34 [2021-12-15 10:48:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:09,365 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 518 transitions. [2021-12-15 10:48:09,365 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-15 10:48:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 518 transitions. [2021-12-15 10:48:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 10:48:09,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:09,366 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-15 10:48:09,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 10:48:09,566 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-15 10:48:09,567 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2021-12-15 10:48:09,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:09,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532694128] [2021-12-15 10:48:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:09,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:10,246 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-15 10:48:10,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532694128] [2021-12-15 10:48:10,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532694128] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50705092] [2021-12-15 10:48:10,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:48:10,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:10,248 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-15 10:48:10,248 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-15 10:48:10,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:48:10,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:48:10,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-15 10:48:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:48:10,352 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-15 10:48:10,390 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-15 10:48:10,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:48:10,461 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-15 10:48:10,604 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 10:48:10,605 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-15 10:48:10,706 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 10:48:10,706 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-15 10:48:10,876 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-15 10:48:10,906 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-15 10:48:10,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:48:13,010 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-15 10:48:13,396 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-15 10:48:26,397 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-15 10:48:27,011 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-15 10:48:29,088 WARN L838 $PredicateComparison]: unable to prove that (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_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 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|)) (< |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|)))))) is different from false [2021-12-15 10:48:31,197 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