./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:12:42,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:12:42,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:12:42,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:12:42,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:12:42,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:12:42,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:12:42,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:12:42,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:12:42,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:12:42,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:12:42,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:12:42,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:12:42,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:12:42,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:12:42,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:12:42,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:12:42,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:12:42,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:12:42,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:12:42,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:12:42,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:12:42,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:12:42,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:12:42,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:12:42,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:12:42,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:12:42,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:12:42,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:12:42,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:12:42,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:12:42,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:12:42,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:12:42,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:12:42,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:12:42,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:12:42,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:12:42,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:12:42,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:12:42,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:12:42,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:12:42,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:12:42,745 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:12:42,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:12:42,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:12:42,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:12:42,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:12:42,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:12:42,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:12:42,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:12:42,747 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:12:42,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:12:42,747 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:12:42,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:12:42,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:12:42,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:12:42,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:12:42,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:12:42,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:12:42,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:12:42,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:12:42,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:12:42,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:12:42,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:12:42,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:12:42,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:12:42,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:12:42,751 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:12:42,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:12:42,752 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:12:42,752 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2023-02-15 10:12:42,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:12:42,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:12:42,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:12:42,987 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:12:42,987 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:12:42,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2023-02-15 10:12:44,027 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:12:44,149 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:12:44,150 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2023-02-15 10:12:44,154 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39ec8b98/f9e878126d5d4bdeb33b0c9f59b33eb9/FLAG633ff3a3c [2023-02-15 10:12:44,166 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39ec8b98/f9e878126d5d4bdeb33b0c9f59b33eb9 [2023-02-15 10:12:44,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:12:44,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:12:44,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:12:44,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:12:44,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:12:44,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573ba31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44, skipping insertion in model container [2023-02-15 10:12:44,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:12:44,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:12:44,281 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2023-02-15 10:12:44,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:12:44,302 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:12:44,311 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2023-02-15 10:12:44,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:12:44,327 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:12:44,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44 WrapperNode [2023-02-15 10:12:44,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:12:44,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:12:44,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:12:44,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:12:44,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,373 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-15 10:12:44,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:12:44,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:12:44,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:12:44,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:12:44,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:12:44,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:12:44,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:12:44,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:12:44,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (1/1) ... [2023-02-15 10:12:44,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:12:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:44,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:12:44,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:12:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:12:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:12:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:12:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:12:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:12:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:12:44,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:12:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:12:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:12:44,530 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:12:44,531 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:12:44,652 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:12:44,657 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:12:44,657 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:12:44,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:12:44 BoogieIcfgContainer [2023-02-15 10:12:44,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:12:44,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:12:44,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:12:44,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:12:44,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:12:44" (1/3) ... [2023-02-15 10:12:44,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b68242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:12:44, skipping insertion in model container [2023-02-15 10:12:44,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:44" (2/3) ... [2023-02-15 10:12:44,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b68242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:12:44, skipping insertion in model container [2023-02-15 10:12:44,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:12:44" (3/3) ... [2023-02-15 10:12:44,667 INFO L112 eAbstractionObserver]: Analyzing ICFG s4if.c [2023-02-15 10:12:44,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:12:44,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:12:44,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:12:44,733 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6701380a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:12:44,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:12:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 10:12:44,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:44,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:44,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2023-02-15 10:12:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:44,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504501805] [2023-02-15 10:12:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:44,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504501805] [2023-02-15 10:12:44,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504501805] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:12:44,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:12:44,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:12:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887552078] [2023-02-15 10:12:44,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:12:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:12:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:12:44,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:12:44,988 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:45,000 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-02-15 10:12:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:12:45,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 10:12:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:45,009 INFO L225 Difference]: With dead ends: 34 [2023-02-15 10:12:45,009 INFO L226 Difference]: Without dead ends: 15 [2023-02-15 10:12:45,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:12:45,015 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:45,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:12:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-15 10:12:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-15 10:12:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-15 10:12:45,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-02-15 10:12:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:45,040 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-15 10:12:45,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-15 10:12:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 10:12:45,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:45,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:45,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:12:45,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:45,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2023-02-15 10:12:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:45,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394155084] [2023-02-15 10:12:45,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:45,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394155084] [2023-02-15 10:12:45,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394155084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:12:45,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:12:45,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:12:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952469921] [2023-02-15 10:12:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:12:45,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:12:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:12:45,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:12:45,233 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:45,282 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-02-15 10:12:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:12:45,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 10:12:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:45,283 INFO L225 Difference]: With dead ends: 28 [2023-02-15 10:12:45,283 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 10:12:45,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:12:45,284 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:45,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:12:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 10:12:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-02-15 10:12:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2023-02-15 10:12:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-15 10:12:45,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-02-15 10:12:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:45,288 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-15 10:12:45,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-15 10:12:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:12:45,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:45,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:12:45,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2023-02-15 10:12:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99158309] [2023-02-15 10:12:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:45,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:45,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99158309] [2023-02-15 10:12:45,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99158309] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:45,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383378459] [2023-02-15 10:12:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:45,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:45,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:45,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:12:45,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:12:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:45,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 10:12:45,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:45,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:12:45,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:12:45,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:46,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:12:46,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-02-15 10:12:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:46,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:46,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:12:46,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2023-02-15 10:12:46,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:46,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2023-02-15 10:12:46,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 10:12:46,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 10:12:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:46,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383378459] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:46,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:12:46,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2023-02-15 10:12:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237698237] [2023-02-15 10:12:46,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:46,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 10:12:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 10:12:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2023-02-15 10:12:46,481 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:46,832 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-15 10:12:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:12:46,833 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 16 [2023-02-15 10:12:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:46,833 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:12:46,833 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 10:12:46,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=530, Unknown=1, NotChecked=0, Total=702 [2023-02-15 10:12:46,835 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:46,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:12:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 10:12:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2023-02-15 10:12:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-15 10:12:46,840 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2023-02-15 10:12:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:46,840 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-15 10:12:46,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-15 10:12:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:12:46,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:46,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:46,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:12:47,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:47,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:47,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2023-02-15 10:12:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:47,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021857769] [2023-02-15 10:12:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:47,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:12:47,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710921614] [2023-02-15 10:12:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:47,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:47,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:12:47,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:12:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:47,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 10:12:47,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:47,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:12:47,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:12:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:47,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:47,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 10:12:47,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-15 10:12:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:47,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021857769] [2023-02-15 10:12:47,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:12:47,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710921614] [2023-02-15 10:12:47,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710921614] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:47,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:12:47,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-15 10:12:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529037197] [2023-02-15 10:12:47,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:12:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:12:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:12:47,215 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:47,256 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-15 10:12:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:12:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 16 [2023-02-15 10:12:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:47,257 INFO L225 Difference]: With dead ends: 38 [2023-02-15 10:12:47,257 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 10:12:47,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:12:47,258 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:47,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:12:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 10:12:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-15 10:12:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-15 10:12:47,263 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2023-02-15 10:12:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:47,263 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-15 10:12:47,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-15 10:12:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:12:47,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:47,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:47,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:12:47,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 10:12:47,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2023-02-15 10:12:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:47,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051276720] [2023-02-15 10:12:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:47,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051276720] [2023-02-15 10:12:47,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051276720] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:47,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833234839] [2023-02-15 10:12:47,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:12:47,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:47,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:47,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:12:47,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:12:47,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:12:47,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:12:47,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:12:47,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:47,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:47,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833234839] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:47,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:12:47,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:12:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737965380] [2023-02-15 10:12:47,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:12:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:12:47,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:12:47,679 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:47,768 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-15 10:12:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:12:47,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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 18 [2023-02-15 10:12:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:47,769 INFO L225 Difference]: With dead ends: 33 [2023-02-15 10:12:47,769 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 10:12:47,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:12:47,770 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:47,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:12:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 10:12:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-15 10:12:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-02-15 10:12:47,773 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2023-02-15 10:12:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:47,774 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-02-15 10:12:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-02-15 10:12:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:12:47,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:47,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:47,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:12:47,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:47,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2023-02-15 10:12:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:47,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169512584] [2023-02-15 10:12:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:48,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:48,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169512584] [2023-02-15 10:12:48,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169512584] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:48,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564846247] [2023-02-15 10:12:48,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:12:48,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:48,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:48,042 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:12:48,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:12:48,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:12:48,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:12:48,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:12:48,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:48,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:48,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564846247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:48,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:12:48,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:12:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726560982] [2023-02-15 10:12:48,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:48,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:12:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:12:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:12:48,154 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:48,217 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-15 10:12:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:12:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:12:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:48,218 INFO L225 Difference]: With dead ends: 37 [2023-02-15 10:12:48,218 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 10:12:48,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:12:48,219 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:48,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:12:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 10:12:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-02-15 10:12:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-15 10:12:48,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2023-02-15 10:12:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:48,223 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-15 10:12:48,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-15 10:12:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:12:48,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:48,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:12:48,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:12:48,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:48,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2023-02-15 10:12:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:48,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322897777] [2023-02-15 10:12:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:48,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322897777] [2023-02-15 10:12:48,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322897777] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:48,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946686937] [2023-02-15 10:12:48,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:12:48,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:48,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:48,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:12:48,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:12:48,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:12:48,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:12:48,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 10:12:48,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:48,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:12:48,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:12:48,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:48,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:49,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:12:49,212 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:12:49,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 10:12:49,313 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:12:49,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2023-02-15 10:12:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:49,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:54,169 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (not (= .cse0 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse6 .cse7 .cse8)) (not (= .cse8 4)) (not (= .cse6 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|))))))))) is different from false [2023-02-15 10:12:54,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse0 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse7 .cse8 .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse9 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse7 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))))) is different from false [2023-02-15 10:12:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 10:12:54,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946686937] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:54,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:12:54,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2023-02-15 10:12:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209671896] [2023-02-15 10:12:54,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:54,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 10:12:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:54,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 10:12:54,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=934, Unknown=4, NotChecked=126, Total=1190 [2023-02-15 10:12:54,267 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 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) [2023-02-15 10:13:03,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:05,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:12,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:13:14,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:16,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:18,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:22,584 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-15 10:13:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 10:13:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 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 21 [2023-02-15 10:13:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:22,589 INFO L225 Difference]: With dead ends: 52 [2023-02-15 10:13:22,589 INFO L226 Difference]: Without dead ends: 41 [2023-02-15 10:13:22,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=361, Invalid=2394, Unknown=9, NotChecked=206, Total=2970 [2023-02-15 10:13:22,590 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:22,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 83 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 505 Invalid, 5 Unknown, 71 Unchecked, 12.6s Time] [2023-02-15 10:13:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-15 10:13:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-02-15 10:13:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-02-15 10:13:22,600 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2023-02-15 10:13:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:22,600 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-02-15 10:13:22,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 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) [2023-02-15 10:13:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-02-15 10:13:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:13:22,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:22,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:22,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 10:13:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:22,807 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2023-02-15 10:13:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:22,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333063330] [2023-02-15 10:13:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:22,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:13:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91981670] [2023-02-15 10:13:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:22,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:22,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:22,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:13:22,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:13:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:22,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 10:13:22,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:22,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:13:22,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:22,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:13:23,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:13:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:23,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:23,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:13:23,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-15 10:13:23,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:13:23,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2023-02-15 10:13:23,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:13:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:23,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333063330] [2023-02-15 10:13:23,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:13:23,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91981670] [2023-02-15 10:13:23,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91981670] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:23,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:13:23,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-15 10:13:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601719645] [2023-02-15 10:13:23,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 10:13:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 10:13:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=165, Unknown=5, NotChecked=0, Total=210 [2023-02-15 10:13:23,152 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:23,303 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-02-15 10:13:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:13:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:13:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:23,305 INFO L225 Difference]: With dead ends: 52 [2023-02-15 10:13:23,305 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:13:23,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=267, Unknown=5, NotChecked=0, Total=342 [2023-02-15 10:13:23,306 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:23,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:13:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-02-15 10:13:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-15 10:13:23,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2023-02-15 10:13:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:23,315 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-15 10:13:23,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-15 10:13:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:13:23,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:23,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:23,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 10:13:23,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:23,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:23,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2023-02-15 10:13:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:23,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832065823] [2023-02-15 10:13:23,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832065823] [2023-02-15 10:13:23,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832065823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19686061] [2023-02-15 10:13:23,605 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:13:23,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:23,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:23,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:13:23,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:13:23,656 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 10:13:23,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:13:23,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:23,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:23,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19686061] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:23,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:23,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:13:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44049863] [2023-02-15 10:13:23,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:23,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:13:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:13:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:13:23,762 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:23,884 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-02-15 10:13:23,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:13:23,885 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:13:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:23,885 INFO L225 Difference]: With dead ends: 47 [2023-02-15 10:13:23,885 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 10:13:23,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:13:23,886 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:23,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 10:13:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-02-15 10:13:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-15 10:13:23,891 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2023-02-15 10:13:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:23,892 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-15 10:13:23,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-15 10:13:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:13:23,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:23,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:23,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:24,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:24,093 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2023-02-15 10:13:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:24,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794600737] [2023-02-15 10:13:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:24,101 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:13:24,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395441309] [2023-02-15 10:13:24,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:13:24,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:24,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:24,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:13:24,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:13:24,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:13:24,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:24,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:13:24,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:24,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:24,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794600737] [2023-02-15 10:13:24,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:13:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395441309] [2023-02-15 10:13:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395441309] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:24,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:13:24,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-15 10:13:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060703079] [2023-02-15 10:13:24,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:24,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:13:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:13:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:13:24,247 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:24,322 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2023-02-15 10:13:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:13:24,323 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 10:13:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:24,323 INFO L225 Difference]: With dead ends: 51 [2023-02-15 10:13:24,323 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 10:13:24,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-02-15 10:13:24,324 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:24,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:13:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 10:13:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-02-15 10:13:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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) [2023-02-15 10:13:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-15 10:13:24,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-02-15 10:13:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:24,328 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-15 10:13:24,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-15 10:13:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:13:24,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:24,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:24,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 10:13:24,531 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2023-02-15 10:13:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:24,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824417949] [2023-02-15 10:13:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:25,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824417949] [2023-02-15 10:13:25,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824417949] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:25,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660352071] [2023-02-15 10:13:25,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 10:13:25,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:25,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:25,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:13:25,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:13:25,390 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-15 10:13:25,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:25,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 10:13:25,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:25,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:13:25,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:25,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:25,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:25,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:25,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:25,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:25,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:13:25,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:25,737 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:13:25,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-15 10:13:25,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:25,938 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-15 10:13:25,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2023-02-15 10:13:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:26,084 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-15 10:13:26,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 33 [2023-02-15 10:13:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:26,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:30,495 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ .cse1 .cse2 .cse3 .cse0) (+ 5 .cse4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse8 .cse9 .cse10 .cse7)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))))))) is different from false [2023-02-15 10:13:30,570 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse1 .cse2 .cse3 .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2023-02-15 10:13:30,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 11) (+ .cse1 .cse2 .cse3 .cse0)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2023-02-15 10:13:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-15 10:13:30,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660352071] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:30,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:30,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2023-02-15 10:13:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665342393] [2023-02-15 10:13:30,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:30,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 10:13:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 10:13:30,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1721, Unknown=4, NotChecked=258, Total=2162 [2023-02-15 10:13:30,815 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 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) [2023-02-15 10:13:53,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:56,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:13:58,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:14:10,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:14:13,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:14:15,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:14:17,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:14:22,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-15 10:14:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:33,937 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2023-02-15 10:14:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 10:14:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 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 26 [2023-02-15 10:14:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:33,940 INFO L225 Difference]: With dead ends: 70 [2023-02-15 10:14:33,940 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 10:14:33,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=670, Invalid=5336, Unknown=12, NotChecked=462, Total=6480 [2023-02-15 10:14:33,942 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 94 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:33,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 93 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 714 Invalid, 8 Unknown, 134 Unchecked, 18.7s Time] [2023-02-15 10:14:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 10:14:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2023-02-15 10:14:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-15 10:14:33,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 26 [2023-02-15 10:14:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:33,954 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-15 10:14:33,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 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) [2023-02-15 10:14:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-15 10:14:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:14:33,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:33,956 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:33,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:14:34,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:34,162 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:34,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 3 times [2023-02-15 10:14:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:34,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438143277] [2023-02-15 10:14:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:34,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:14:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343212723] [2023-02-15 10:14:34,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:14:34,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:34,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:34,174 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) [2023-02-15 10:14:34,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:14:34,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 10:14:34,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:34,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 10:14:34,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:34,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 10:14:34,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:34,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 10:14:34,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:34,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 10:14:34,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:14:34,365 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2023-02-15 10:14:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 10:14:34,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:34,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:14:34,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-15 10:14:34,554 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-15 10:14:34,556 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 30 [2023-02-15 10:14:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 10:14:36,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:36,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438143277] [2023-02-15 10:14:36,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:14:36,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343212723] [2023-02-15 10:14:36,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343212723] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:36,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:14:36,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-15 10:14:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504345705] [2023-02-15 10:14:36,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:36,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 10:14:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 10:14:36,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=175, Unknown=3, NotChecked=0, Total=240 [2023-02-15 10:14:36,589 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:36,715 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-02-15 10:14:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:14:36,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:14:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:36,716 INFO L225 Difference]: With dead ends: 59 [2023-02-15 10:14:36,716 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 10:14:36,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=120, Invalid=257, Unknown=3, NotChecked=0, Total=380 [2023-02-15 10:14:36,717 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:36,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 23 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:14:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 10:14:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-15 10:14:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-02-15 10:14:36,725 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 26 [2023-02-15 10:14:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:36,725 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-02-15 10:14:36,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-02-15 10:14:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:14:36,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:36,726 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:36,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-15 10:14:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 10:14:36,932 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 7 times [2023-02-15 10:14:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445768544] [2023-02-15 10:14:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:37,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445768544] [2023-02-15 10:14:37,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445768544] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:37,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914066066] [2023-02-15 10:14:37,268 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 10:14:37,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:37,270 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) [2023-02-15 10:14:37,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 10:14:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:37,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:14:37,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:37,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914066066] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:37,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 10:14:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239559936] [2023-02-15 10:14:37,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:14:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:14:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:14:37,508 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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) [2023-02-15 10:14:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:37,690 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-02-15 10:14:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:14:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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 28 [2023-02-15 10:14:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:37,691 INFO L225 Difference]: With dead ends: 69 [2023-02-15 10:14:37,691 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 10:14:37,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:14:37,692 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:37,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 34 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:14:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 10:14:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-02-15 10:14:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-15 10:14:37,700 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2023-02-15 10:14:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:37,700 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-15 10:14:37,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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) [2023-02-15 10:14:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-15 10:14:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 10:14:37,701 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:37,701 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:37,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 10:14:37,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 10:14:37,906 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 8 times [2023-02-15 10:14:37,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:37,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875714418] [2023-02-15 10:14:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:37,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875714418] [2023-02-15 10:14:38,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875714418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139726628] [2023-02-15 10:14:38,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:14:38,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:38,569 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) [2023-02-15 10:14:38,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 10:14:38,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:14:38,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:38,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 10:14:38,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:38,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:14:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:38,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:14:38,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:38,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:14:38,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:38,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:14:38,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:38,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:14:38,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:38,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:14:38,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:38,997 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:14:38,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 10:14:39,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:39,115 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:14:39,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2023-02-15 10:14:39,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:39,232 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:14:39,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2023-02-15 10:14:39,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:39,310 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:14:39,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2023-02-15 10:14:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:39,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:46,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (< (+ .cse0 3) (+ .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= 4 .cse5)) (not (= .cse4 4)) (not (= .cse3 4)) (not (= .cse2 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ 5 .cse0)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse10 4)))))))))))) is different from false [2023-02-15 10:14:46,606 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (< (+ 7 .cse3) (+ .cse4 .cse5 .cse2 .cse1 .cse0)) (not (= .cse5 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ .cse3 9)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse10 4)))))))))))) is different from false [2023-02-15 10:14:46,735 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (< (+ .cse1 .cse2 .cse3 .cse4 .cse0) (+ .cse5 13)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse2 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse8)) (not (= .cse9 4)) (not (= .cse10 4)) (< (+ .cse5 11) (+ .cse11 .cse12 .cse10 .cse9 .cse8)) (not (= .cse12 4)))))))))))) is different from false [2023-02-15 10:14:46,919 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse3 .cse1 .cse4 .cse0) (+ .cse5 17)) (not (= .cse4 4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse8)) (not (= .cse9 4)) (< (+ .cse5 15) (+ .cse10 .cse11 .cse12 .cse9 .cse8)) (not (= .cse12 4)) (not (= .cse11 4)))))))))))) is different from false [2023-02-15 10:14:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-02-15 10:14:46,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139726628] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:46,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:46,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2023-02-15 10:14:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235872272] [2023-02-15 10:14:46,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:46,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 10:14:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 10:14:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2084, Unknown=6, NotChecked=380, Total=2652 [2023-02-15 10:14:46,998 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:53,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:15:00,293 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 117 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:15:02,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:15:12,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:15:18,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:15:21,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-15 10:15:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:21,058 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2023-02-15 10:15:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 10:15:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 [2023-02-15 10:15:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:21,059 INFO L225 Difference]: With dead ends: 78 [2023-02-15 10:15:21,059 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 10:15:21,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=326, Invalid=3715, Unknown=7, NotChecked=508, Total=4556 [2023-02-15 10:15:21,061 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:21,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 962 Invalid, 5 Unknown, 155 Unchecked, 12.2s Time] [2023-02-15 10:15:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 10:15:21,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2023-02-15 10:15:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 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) [2023-02-15 10:15:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2023-02-15 10:15:21,075 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 31 [2023-02-15 10:15:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:21,075 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2023-02-15 10:15:21,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2023-02-15 10:15:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 10:15:21,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:21,078 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:21,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 10:15:21,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 10:15:21,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1338916473, now seen corresponding path program 4 times [2023-02-15 10:15:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:21,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827731091] [2023-02-15 10:15:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:21,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:15:21,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82016711] [2023-02-15 10:15:21,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:15:21,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:21,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:21,289 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) [2023-02-15 10:15:21,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 10:15:21,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:15:21,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:21,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 10:15:21,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:21,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:15:21,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 10:15:21,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-02-15 10:15:21,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 10:15:21,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 10:15:21,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-15 10:15:21,645 INFO L321 Elim1Store]: treesize reduction 14, result has 60.0 percent of original size [2023-02-15 10:15:21,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2023-02-15 10:15:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:15:21,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:22,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:15:22,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 51 [2023-02-15 10:15:22,162 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-02-15 10:15:22,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 50 [2023-02-15 10:15:22,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-02-15 10:15:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827731091] [2023-02-15 10:15:22,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:15:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82016711] [2023-02-15 10:15:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82016711] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:22,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:15:22,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2023-02-15 10:15:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102740461] [2023-02-15 10:15:22,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:22,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 10:15:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:22,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 10:15:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 10:15:22,227 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:26,330 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2023-02-15 10:15:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-15 10:15:26,331 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 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 31 [2023-02-15 10:15:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:26,331 INFO L225 Difference]: With dead ends: 123 [2023-02-15 10:15:26,331 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 10:15:26,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1354, Invalid=5287, Unknown=1, NotChecked=0, Total=6642 [2023-02-15 10:15:26,333 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 201 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:26,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 51 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:15:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 10:15:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 61. [2023-02-15 10:15:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-02-15 10:15:26,344 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 31 [2023-02-15 10:15:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:26,344 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-02-15 10:15:26,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-02-15 10:15:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 10:15:26,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:26,345 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:26,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:26,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 10:15:26,550 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 9 times [2023-02-15 10:15:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:26,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850968144] [2023-02-15 10:15:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:15:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:26,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850968144] [2023-02-15 10:15:26,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850968144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:15:26,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896659887] [2023-02-15 10:15:26,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:15:26,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:26,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:26,705 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) [2023-02-15 10:15:26,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 10:15:26,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-15 10:15:26,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:26,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 10:15:26,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:26,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:26,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896659887] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:26,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:15:26,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-15 10:15:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310887288] [2023-02-15 10:15:26,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:15:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:15:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:15:26,956 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:27,156 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2023-02-15 10:15:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 10:15:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 10:15:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:27,157 INFO L225 Difference]: With dead ends: 100 [2023-02-15 10:15:27,157 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 10:15:27,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2023-02-15 10:15:27,158 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:27,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:15:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 10:15:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 53. [2023-02-15 10:15:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-02-15 10:15:27,168 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 33 [2023-02-15 10:15:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:27,168 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-02-15 10:15:27,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-02-15 10:15:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:15:27,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:27,169 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:27,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-15 10:15:27,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:27,374 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 10 times [2023-02-15 10:15:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:27,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495712268] [2023-02-15 10:15:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:15:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495712268] [2023-02-15 10:15:27,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495712268] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:15:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354884734] [2023-02-15 10:15:27,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:15:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:27,483 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:15:27,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 10:15:27,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:15:27,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:27,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 10:15:27,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:27,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:27,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354884734] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:27,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:15:27,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-15 10:15:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579955459] [2023-02-15 10:15:27,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:27,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:15:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:15:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:15:27,764 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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) [2023-02-15 10:15:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:27,960 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2023-02-15 10:15:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:15:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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 34 [2023-02-15 10:15:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:27,961 INFO L225 Difference]: With dead ends: 101 [2023-02-15 10:15:27,961 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 10:15:27,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2023-02-15 10:15:27,962 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:27,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 40 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:15:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 10:15:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2023-02-15 10:15:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 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) [2023-02-15 10:15:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-02-15 10:15:27,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2023-02-15 10:15:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:27,969 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-02-15 10:15:27,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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) [2023-02-15 10:15:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-02-15 10:15:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:15:27,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:27,970 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:27,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:28,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 10:15:28,175 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 11 times [2023-02-15 10:15:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:28,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029222636] [2023-02-15 10:15:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:15:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029222636] [2023-02-15 10:15:29,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029222636] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:15:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457634136] [2023-02-15 10:15:29,017 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:15:29,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:29,018 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:15:29,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 10:15:29,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-15 10:15:29,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:29,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 10:15:29,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:29,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:15:29,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:15:29,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:29,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:29,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:29,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:29,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:29,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:15:29,505 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:15:29,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2023-02-15 10:15:29,645 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 10:15:29,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 51 [2023-02-15 10:15:29,870 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-15 10:15:29,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 66 [2023-02-15 10:15:30,083 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-02-15 10:15:30,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 77 [2023-02-15 10:15:32,339 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-02-15 10:15:32,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 41 [2023-02-15 10:15:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:32,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:09,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457634136] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:09,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:17:09,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 72 [2023-02-15 10:17:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890523680] [2023-02-15 10:17:09,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:09,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-15 10:17:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-15 10:17:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=4569, Unknown=143, NotChecked=0, Total=5112 [2023-02-15 10:17:09,523 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)