./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s12if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 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/s12if.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 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-14 22:18:22,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:18:22,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:18:22,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:18:22,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:18:22,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:18:22,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:18:22,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:18:22,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:18:22,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:18:22,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:18:22,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:18:22,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:18:22,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:18:22,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:18:22,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:18:22,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:18:22,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:18:22,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:18:22,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:18:22,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:18:22,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:18:22,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:18:22,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:18:22,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:18:22,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:18:22,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:18:22,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:18:22,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:18:22,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:18:22,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:18:22,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:18:22,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:18:22,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:18:22,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:18:22,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:18:22,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:18:22,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:18:22,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:18:22,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:18:22,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:18:22,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:18:22,110 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:18:22,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:18:22,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:18:22,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:18:22,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:18:22,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:18:22,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:18:22,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:18:22,113 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:18:22,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:18:22,113 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:18:22,114 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:18:22,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:18:22,115 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:18:22,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:18:22,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:18:22,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:18:22,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:18:22,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:18:22,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:18:22,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:18:22,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:18:22,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:18:22,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:18:22,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:18:22,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:18:22,117 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:18:22,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:18:22,118 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:18:22,118 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 -> 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 [2023-02-14 22:18:22,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:18:22,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:18:22,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:18:22,322 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:18:22,322 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:18:22,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12if.c [2023-02-14 22:18:23,351 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:18:23,475 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:18:23,476 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c [2023-02-14 22:18:23,480 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5426fd2a8/fbfa81b03c3f40d9883c6315d0c4627d/FLAGa814d6601 [2023-02-14 22:18:23,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5426fd2a8/fbfa81b03c3f40d9883c6315d0c4627d [2023-02-14 22:18:23,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:18:23,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:18:23,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:18:23,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:18:23,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:18:23,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f2065e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23, skipping insertion in model container [2023-02-14 22:18:23,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:18:23,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:18:23,595 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/s12if.c[588,601] [2023-02-14 22:18:23,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:18:23,621 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:18:23,632 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/s12if.c[588,601] [2023-02-14 22:18:23,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:18:23,648 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:18:23,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23 WrapperNode [2023-02-14 22:18:23,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:18:23,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:18:23,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:18:23,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:18:23,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,671 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-14 22:18:23,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:18:23,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:18:23,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:18:23,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:18:23,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,701 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:18:23,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:18:23,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:18:23,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:18:23,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (1/1) ... [2023-02-14 22:18:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:18:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:23,735 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-14 22:18:23,737 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-14 22:18:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:18:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:18:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 22:18:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 22:18:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 22:18:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:18:23,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:18:23,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 22:18:23,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 22:18:23,835 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:18:23,838 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:18:23,978 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:18:23,982 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:18:23,982 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 22:18:23,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:18:23 BoogieIcfgContainer [2023-02-14 22:18:23,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:18:23,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:18:23,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:18:23,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:18:23,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:18:23" (1/3) ... [2023-02-14 22:18:23,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261c83ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:18:23, skipping insertion in model container [2023-02-14 22:18:23,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:18:23" (2/3) ... [2023-02-14 22:18:24,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261c83ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:18:24, skipping insertion in model container [2023-02-14 22:18:24,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:18:23" (3/3) ... [2023-02-14 22:18:24,001 INFO L112 eAbstractionObserver]: Analyzing ICFG s12if.c [2023-02-14 22:18:24,011 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:18:24,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:18:24,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:18:24,043 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;@71be9ad2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:18:24,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:18:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 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-14 22:18:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 22:18:24,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:24,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:24,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2023-02-14 22:18:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:24,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666099221] [2023-02-14 22:18:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:24,158 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-14 22:18:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666099221] [2023-02-14 22:18:24,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666099221] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:18:24,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:18:24,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 22:18:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241965809] [2023-02-14 22:18:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:18:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 22:18:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 22:18:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:18:24,184 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:24,196 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2023-02-14 22:18:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 22:18:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-14 22:18:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:24,203 INFO L225 Difference]: With dead ends: 42 [2023-02-14 22:18:24,204 INFO L226 Difference]: Without dead ends: 19 [2023-02-14 22:18:24,206 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-14 22:18:24,210 INFO L413 NwaCegarLoop]: 28 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, 28 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-14 22:18:24,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:18:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-14 22:18:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-14 22:18:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-14 22:18:24,236 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2023-02-14 22:18:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:24,237 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-14 22:18:24,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-14 22:18:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 22:18:24,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:24,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:24,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:18:24,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2023-02-14 22:18:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:24,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115591172] [2023-02-14 22:18:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:24,350 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-14 22:18:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:24,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115591172] [2023-02-14 22:18:24,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115591172] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:18:24,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:18:24,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 22:18:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116109122] [2023-02-14 22:18:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:18:24,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:18:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:24,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:18:24,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:18:24,353 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:24,407 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2023-02-14 22:18:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 22:18:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-14 22:18:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:24,408 INFO L225 Difference]: With dead ends: 39 [2023-02-14 22:18:24,408 INFO L226 Difference]: Without dead ends: 27 [2023-02-14 22:18:24,408 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-14 22:18:24,409 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:24,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:18:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-14 22:18:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-14 22:18:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-14 22:18:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-14 22:18:24,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2023-02-14 22:18:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:24,418 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-14 22:18:24,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-14 22:18:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 22:18:24,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:24,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:24,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 22:18:24,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2023-02-14 22:18:24,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:24,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041395991] [2023-02-14 22:18:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:24,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041395991] [2023-02-14 22:18:24,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041395991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:24,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127829909] [2023-02-14 22:18:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:24,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:24,860 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-14 22:18:24,884 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-14 22:18:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:24,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 22:18:24,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:25,019 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-14 22:18:25,025 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 11 treesize of output 7 [2023-02-14 22:18:25,050 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-14 22:18:25,106 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-14 22:18:25,149 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-14 22:18:25,200 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 51 treesize of output 23 [2023-02-14 22:18:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:25,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:25,287 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_45 (Array Int Int))) (let ((.cse0 (select v_ArrVal_45 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 2 .cse0)) (= (* c_~N~0 2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0))))) is different from false [2023-02-14 22:18:25,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:18:25,376 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 28 treesize of output 29 [2023-02-14 22:18:25,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:18:25,380 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 26 treesize of output 18 [2023-02-14 22:18:25,383 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-14 22:18:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-14 22:18:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127829909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:25,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:25,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2023-02-14 22:18:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230366457] [2023-02-14 22:18:25,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:25,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 22:18:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 22:18:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=357, Unknown=1, NotChecked=40, Total=506 [2023-02-14 22:18:25,409 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:31,171 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2023-02-14 22:18:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 22:18:31,173 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 22:18:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:31,174 INFO L225 Difference]: With dead ends: 64 [2023-02-14 22:18:31,174 INFO L226 Difference]: Without dead ends: 60 [2023-02-14 22:18:31,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=296, Invalid=893, Unknown=5, NotChecked=66, Total=1260 [2023-02-14 22:18:31,176 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 103 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 23 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:31,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 84 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 303 Invalid, 18 Unknown, 55 Unchecked, 0.2s Time] [2023-02-14 22:18:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-14 22:18:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2023-02-14 22:18:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 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-14 22:18:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-02-14 22:18:31,190 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 21 [2023-02-14 22:18:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:31,190 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-02-14 22:18:31,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-02-14 22:18:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 22:18:31,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:31,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:31,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 22:18:31,397 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-14 22:18:31,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2023-02-14 22:18:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:31,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919901188] [2023-02-14 22:18:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:31,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:18:31,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000429189] [2023-02-14 22:18:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:31,430 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-14 22:18:31,445 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-14 22:18:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:31,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 22:18:31,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:31,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 22:18:31,552 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-14 22:18:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:31,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:31,591 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 37 treesize of output 31 [2023-02-14 22:18:31,594 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:18:31,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2023-02-14 22:18:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:31,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919901188] [2023-02-14 22:18:31,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:18:31,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000429189] [2023-02-14 22:18:31,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000429189] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:31,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:18:31,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-14 22:18:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123017837] [2023-02-14 22:18:31,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:31,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 22:18:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 22:18:31,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-02-14 22:18:31,606 INFO L87 Difference]: Start difference. First operand 35 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-14 22:18:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:31,732 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-02-14 22:18:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 22:18:31,733 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 21 [2023-02-14 22:18:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:31,733 INFO L225 Difference]: With dead ends: 64 [2023-02-14 22:18:31,733 INFO L226 Difference]: Without dead ends: 52 [2023-02-14 22:18:31,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-02-14 22:18:31,734 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:31,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:18:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-14 22:18:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2023-02-14 22:18:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 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-14 22:18:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2023-02-14 22:18:31,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2023-02-14 22:18:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:31,741 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-02-14 22:18:31,741 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-14 22:18:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2023-02-14 22:18:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 22:18:31,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:31,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:31,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-14 22:18:31,946 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-14 22:18:31,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2023-02-14 22:18:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:31,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441399711] [2023-02-14 22:18:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:32,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:32,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441399711] [2023-02-14 22:18:32,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441399711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:32,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636360279] [2023-02-14 22:18:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:32,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:32,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:32,277 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-14 22:18:32,278 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-14 22:18:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:32,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 22:18:32,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:32,349 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-14 22:18:32,381 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-14 22:18:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:32,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:32,421 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-14 22:18:32,424 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-14 22:18:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:32,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636360279] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:32,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:32,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2023-02-14 22:18:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282060229] [2023-02-14 22:18:32,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:32,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 22:18:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 22:18:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:18:32,440 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 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-14 22:18:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:32,930 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2023-02-14 22:18:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 22:18:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 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-14 22:18:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:32,931 INFO L225 Difference]: With dead ends: 79 [2023-02-14 22:18:32,931 INFO L226 Difference]: Without dead ends: 65 [2023-02-14 22:18:32,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 22:18:32,932 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:32,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 68 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:18:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-14 22:18:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2023-02-14 22:18:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-02-14 22:18:32,939 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2023-02-14 22:18:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:32,940 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-02-14 22:18:32,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 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-14 22:18:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-02-14 22:18:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 22:18:32,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:32,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:32,957 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-14 22:18:33,145 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-14 22:18:33,145 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2023-02-14 22:18:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:33,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010326227] [2023-02-14 22:18:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:33,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010326227] [2023-02-14 22:18:33,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010326227] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:33,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834716666] [2023-02-14 22:18:33,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:18:33,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:33,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:33,197 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-14 22:18:33,230 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-14 22:18:33,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:18:33,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:18:33,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 22:18:33,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:33,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:33,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834716666] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:33,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:33,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-14 22:18:33,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057693254] [2023-02-14 22:18:33,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:33,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 22:18:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 22:18:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-14 22:18:33,339 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:33,479 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2023-02-14 22:18:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 22:18:33,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 22:18:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:33,480 INFO L225 Difference]: With dead ends: 85 [2023-02-14 22:18:33,480 INFO L226 Difference]: Without dead ends: 75 [2023-02-14 22:18:33,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 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-14 22:18:33,481 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:33,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 28 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:18:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-14 22:18:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2023-02-14 22:18:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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-14 22:18:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-02-14 22:18:33,490 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2023-02-14 22:18:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:33,490 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-02-14 22:18:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-02-14 22:18:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 22:18:33,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:33,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:33,497 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-14 22:18:33,695 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-14 22:18:33,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2023-02-14 22:18:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258283957] [2023-02-14 22:18:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258283957] [2023-02-14 22:18:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258283957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672205063] [2023-02-14 22:18:33,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:18:33,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:33,750 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-14 22:18:33,752 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-14 22:18:33,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 22:18:33,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:18:33,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 22:18:33,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:33,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:18:33,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672205063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:33,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:33,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-14 22:18:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649527505] [2023-02-14 22:18:33,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:33,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 22:18:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 22:18:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-14 22:18:33,883 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 22:18:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:33,984 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2023-02-14 22:18:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 22:18:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 22:18:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:33,985 INFO L225 Difference]: With dead ends: 78 [2023-02-14 22:18:33,985 INFO L226 Difference]: Without dead ends: 42 [2023-02-14 22:18:33,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 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-14 22:18:33,986 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:33,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:18:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-14 22:18:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-02-14 22:18:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-02-14 22:18:33,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2023-02-14 22:18:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:33,991 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-02-14 22:18:33,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 22:18:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-02-14 22:18:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 22:18:33,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:33,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:34,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 22:18:34,197 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-14 22:18:34,197 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2023-02-14 22:18:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428030076] [2023-02-14 22:18:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 22:18:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:34,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428030076] [2023-02-14 22:18:34,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428030076] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:34,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052160311] [2023-02-14 22:18:34,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:18:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:34,842 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-14 22:18:34,844 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-14 22:18:34,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:18:34,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:18:34,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-14 22:18:34,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:34,899 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-14 22:18:34,910 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 11 treesize of output 7 [2023-02-14 22:18:34,931 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-14 22:18:34,957 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-14 22:18:35,050 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-14 22:18:35,097 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-14 22:18:35,146 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-14 22:18:35,230 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:18:35,230 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-14 22:18:35,298 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:18:35,298 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 28 [2023-02-14 22:18:35,315 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-14 22:18:35,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:35,547 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse0 .cse1 .cse2) (* c_~N~0 2)) (not (= 2 .cse1)) (not (= 2 .cse2)))))))) is different from false [2023-02-14 22:18:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-14 22:18:36,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052160311] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:36,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:36,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 38 [2023-02-14 22:18:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138273258] [2023-02-14 22:18:36,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-14 22:18:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-14 22:18:36,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1166, Unknown=30, NotChecked=70, Total=1406 [2023-02-14 22:18:36,247 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:36,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~N~0 2))) (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse0 .cse1 .cse2) .cse3) (not (= 2 .cse1)) (not (= 2 .cse2)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (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_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (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_64| 4))))) (or (not (= 2 .cse6)) (= .cse3 (+ .cse7 .cse6 .cse8)) (not (= 2 .cse8)))))))) (< c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2023-02-14 22:18:39,940 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~N~0 2))) (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse0 .cse1 .cse2) .cse3) (not (= 2 .cse1)) (not (= 2 .cse2)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (= c_~N~0 2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (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_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (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_64| 4))))) (or (not (= 2 .cse6)) (= .cse3 (+ .cse7 .cse6 .cse8)) (not (= 2 .cse8)))))))) (< c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse11) (= 2 .cse11)))))) is different from false [2023-02-14 22:18:39,972 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 2 .cse27)) (< (+ .cse28 .cse27 .cse29) 5) (not (= 2 .cse29))))))))) (.cse3 (* c_~N~0 2)) (.cse7 (< |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse8 (< |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse0 .cse1 .cse2) .cse3) (not (= 2 .cse1)) (not (= 2 .cse2)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or .cse6 .cse7) (or .cse6 .cse8) (= c_~N~0 2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse9 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem12#1|) (or (< c_~N~0 2) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (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 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 2 .cse10)) (= .cse3 (+ .cse11 .cse10 .cse12)) (not (= 2 .cse12))))))))) (or .cse7 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 2 .cse15)) (< .cse16 (+ .cse17 .cse15 .cse18 1)) (not (= 2 .cse18))))))))) (or .cse8 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse21 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 2 .cse21)) (not (= 2 .cse22)) (< (+ .cse16 1) (+ .cse23 .cse21 .cse22))))))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse26 (select .cse9 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse26) (= 2 .cse26)))))) is different from false [2023-02-14 22:18:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:40,262 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2023-02-14 22:18:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 22:18:40,262 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-14 22:18:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:40,263 INFO L225 Difference]: With dead ends: 80 [2023-02-14 22:18:40,263 INFO L226 Difference]: Without dead ends: 76 [2023-02-14 22:18:40,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=422, Invalid=2608, Unknown=66, NotChecked=444, Total=3540 [2023-02-14 22:18:40,264 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 106 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:40,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 756 Invalid, 26 Unknown, 102 Unchecked, 0.8s Time] [2023-02-14 22:18:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-14 22:18:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-02-14 22:18:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 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-14 22:18:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2023-02-14 22:18:40,273 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2023-02-14 22:18:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:40,274 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2023-02-14 22:18:40,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2023-02-14 22:18:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 22:18:40,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:40,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:40,279 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-14 22:18:40,477 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-14 22:18:40,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2023-02-14 22:18:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:40,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002033157] [2023-02-14 22:18:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:40,501 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:18:40,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876294897] [2023-02-14 22:18:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:40,513 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-14 22:18:40,546 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-14 22:18:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:40,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-14 22:18:40,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:40,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-14 22:18:40,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:18:40,683 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-14 22:18:40,707 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-14 22:18:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 22:18:40,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:40,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2023-02-14 22:18:40,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:18:40,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2023-02-14 22:18:40,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:18:40,790 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-14 22:18:40,793 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-14 22:18:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2023-02-14 22:18:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002033157] [2023-02-14 22:18:40,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:18:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876294897] [2023-02-14 22:18:40,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876294897] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:40,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:18:40,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-14 22:18:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340115648] [2023-02-14 22:18:40,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:40,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 22:18:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 22:18:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=244, Unknown=2, NotChecked=32, Total=342 [2023-02-14 22:18:40,839 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-14 22:18:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:41,166 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2023-02-14 22:18:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 22:18:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) Word has length 29 [2023-02-14 22:18:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:41,167 INFO L225 Difference]: With dead ends: 116 [2023-02-14 22:18:41,167 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 22:18:41,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=400, Unknown=2, NotChecked=42, Total=552 [2023-02-14 22:18:41,168 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:41,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 90 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 346 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2023-02-14 22:18:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 22:18:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2023-02-14 22:18:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 0 states have call successors, (0), 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-14 22:18:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-02-14 22:18:41,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2023-02-14 22:18:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:41,180 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-02-14 22:18:41,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-14 22:18:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-02-14 22:18:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 22:18:41,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:41,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:41,185 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-14 22:18:41,385 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-14 22:18:41,386 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2023-02-14 22:18:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134973299] [2023-02-14 22:18:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:41,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:18:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715925930] [2023-02-14 22:18:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:41,414 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-14 22:18:41,415 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-14 22:18:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:41,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 22:18:41,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:41,481 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-14 22:18:41,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:18:41,513 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 25 treesize of output 24 [2023-02-14 22:18:41,530 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-14 22:18:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:41,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:41,568 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 16 treesize of output 14 [2023-02-14 22:18:41,570 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 20 treesize of output 16 [2023-02-14 22:18:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134973299] [2023-02-14 22:18:41,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:18:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715925930] [2023-02-14 22:18:41,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715925930] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:41,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:18:41,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-14 22:18:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197736709] [2023-02-14 22:18:41,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:41,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 22:18:41,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 22:18:41,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-14 22:18:41,591 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-14 22:18:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:41,710 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2023-02-14 22:18:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 22:18:41,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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 29 [2023-02-14 22:18:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:41,712 INFO L225 Difference]: With dead ends: 115 [2023-02-14 22:18:41,712 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 22:18:41,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-14 22:18:41,714 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:41,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:18:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 22:18:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2023-02-14 22:18:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2023-02-14 22:18:41,733 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 29 [2023-02-14 22:18:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:41,733 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2023-02-14 22:18:41,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-14 22:18:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2023-02-14 22:18:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 22:18:41,734 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:41,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:41,751 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-14 22:18:41,939 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-14 22:18:41,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2023-02-14 22:18:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:41,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819201653] [2023-02-14 22:18:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:42,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819201653] [2023-02-14 22:18:42,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819201653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:42,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504679803] [2023-02-14 22:18:42,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:18:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:42,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:42,061 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-14 22:18:42,064 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-14 22:18:42,139 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-14 22:18:42,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:18:42,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 22:18:42,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:42,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504679803] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:42,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-14 22:18:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671841333] [2023-02-14 22:18:42,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:42,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 22:18:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 22:18:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-14 22:18:42,239 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:42,436 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2023-02-14 22:18:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 22:18:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 22:18:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:42,437 INFO L225 Difference]: With dead ends: 121 [2023-02-14 22:18:42,437 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 22:18:42,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 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-14 22:18:42,438 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:42,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 40 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:18:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 22:18:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2023-02-14 22:18:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 0 states have call successors, (0), 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-14 22:18:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-02-14 22:18:42,448 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 31 [2023-02-14 22:18:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:42,449 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-02-14 22:18:42,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:18:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-02-14 22:18:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 22:18:42,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:42,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:42,462 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-14 22:18:42,654 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-14 22:18:42,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2023-02-14 22:18:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452837651] [2023-02-14 22:18:42,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:42,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:42,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452837651] [2023-02-14 22:18:42,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452837651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:42,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606863580] [2023-02-14 22:18:42,775 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 22:18:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:42,781 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-14 22:18:42,808 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-14 22:18:42,844 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-14 22:18:42,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:18:42,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 22:18:42,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:42,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:18:42,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606863580] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:42,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:42,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-14 22:18:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895086613] [2023-02-14 22:18:42,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:42,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 22:18:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 22:18:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-14 22:18:42,970 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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-14 22:18:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:18:43,094 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2023-02-14 22:18:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 22:18:43,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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) Word has length 32 [2023-02-14 22:18:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:18:43,095 INFO L225 Difference]: With dead ends: 109 [2023-02-14 22:18:43,095 INFO L226 Difference]: Without dead ends: 53 [2023-02-14 22:18:43,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:18:43,096 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:18:43,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:18:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-14 22:18:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2023-02-14 22:18:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 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-14 22:18:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-02-14 22:18:43,102 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 32 [2023-02-14 22:18:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:18:43,102 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-02-14 22:18:43,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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-14 22:18:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-02-14 22:18:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 22:18:43,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:18:43,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:18:43,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 22:18:43,306 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-14 22:18:43,306 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:18:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:18:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2023-02-14 22:18:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:18:43,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085014645] [2023-02-14 22:18:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:18:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:18:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 22:18:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:18:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085014645] [2023-02-14 22:18:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085014645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:18:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080584496] [2023-02-14 22:18:44,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 22:18:44,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:18:44,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:18:44,104 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-14 22:18:44,105 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-14 22:18:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:18:44,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 22:18:44,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:18:44,217 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-14 22:18:44,222 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 11 treesize of output 7 [2023-02-14 22:18:44,252 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-14 22:18:44,298 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-14 22:18:44,335 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-14 22:18:44,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 14 treesize of output 16 [2023-02-14 22:18:44,427 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-14 22:18:44,442 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-14 22:18:44,492 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-14 22:18:44,570 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:18:44,570 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-14 22:18:44,659 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:18:44,659 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-14 22:18:44,736 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:18:44,736 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 28 [2023-02-14 22:18:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:18:44,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:18:45,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (not (= .cse2 2)) (= (+ .cse0 .cse2 .cse1 .cse3) (* c_~N~0 2))))))))) is different from false [2023-02-14 22:18:45,921 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 22:18:45,921 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 407 treesize of output 1 [2023-02-14 22:18:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2023-02-14 22:18:45,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080584496] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:18:45,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:18:45,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 46 [2023-02-14 22:18:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355264328] [2023-02-14 22:18:45,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:18:45,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 22:18:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:18:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 22:18:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1782, Unknown=2, NotChecked=86, Total=2070 [2023-02-14 22:18:45,925 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:19:21,738 WARN L233 SmtUtils]: Spent 14.18s on a formula simplification. DAG size of input: 110 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:19:23,863 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-14 22:19:56,164 WARN L233 SmtUtils]: Spent 20.11s on a formula simplification. DAG size of input: 100 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:19:58,288 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-14 22:20:00,300 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-14 22:20:10,608 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 112 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:20:12,765 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-14 22:20:33,205 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 103 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:20:35,274 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 [0, 1] [2023-02-14 22:20:37,356 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-14 22:20:39,384 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-14 22:20:41,397 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-14 22:20:43,420 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-14 22:20:45,438 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-14 22:20:59,699 WARN L233 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 113 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:21:01,788 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-14 22:21:15,615 WARN L233 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 85 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:21:27,792 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 85 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:21:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:21:32,442 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2023-02-14 22:21:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-14 22:21:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 22:21:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:21:32,443 INFO L225 Difference]: With dead ends: 133 [2023-02-14 22:21:32,443 INFO L226 Difference]: Without dead ends: 129 [2023-02-14 22:21:32,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 144.3s TimeCoverageRelationStatistics Valid=965, Invalid=6855, Unknown=16, NotChecked=174, Total=8010 [2023-02-14 22:21:32,445 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 161 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 145 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2023-02-14 22:21:32,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 215 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1455 Invalid, 22 Unknown, 72 Unchecked, 23.4s Time] [2023-02-14 22:21:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-14 22:21:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2023-02-14 22:21:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 0 states have call successors, (0), 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-14 22:21:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2023-02-14 22:21:32,459 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 37 [2023-02-14 22:21:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:21:32,459 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2023-02-14 22:21:32,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:21:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2023-02-14 22:21:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 22:21:32,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:21:32,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:21:32,465 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-14 22:21:32,665 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-14 22:21:32,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:21:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:21:32,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2023-02-14 22:21:32,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:21:32,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136494132] [2023-02-14 22:21:32,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:21:32,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:21:32,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:21:32,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559114300] [2023-02-14 22:21:32,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:21:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:21:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:21:32,677 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-14 22:21:32,679 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-14 22:21:32,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:21:32,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:21:32,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 22:21:32,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:21:32,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-14 22:21:32,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:21:32,923 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-14 22:21:32,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:21:32,962 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-14 22:21:32,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:21:32,999 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 21 treesize of output 17 [2023-02-14 22:21:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:21:33,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:21:35,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:21:35,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2023-02-14 22:21:35,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:21:35,620 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 38 [2023-02-14 22:21:35,623 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 13 treesize of output 7 [2023-02-14 22:21:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:21:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:21:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136494132] [2023-02-14 22:21:35,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:21:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559114300] [2023-02-14 22:21:35,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559114300] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:21:35,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:21:35,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-14 22:21:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194508723] [2023-02-14 22:21:35,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:21:35,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 22:21:35,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:21:35,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 22:21:35,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=911, Unknown=10, NotChecked=0, Total=1122 [2023-02-14 22:21:35,837 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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-14 22:21:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:21:37,225 INFO L93 Difference]: Finished difference Result 263 states and 341 transitions. [2023-02-14 22:21:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-14 22:21:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 22:21:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:21:37,227 INFO L225 Difference]: With dead ends: 263 [2023-02-14 22:21:37,227 INFO L226 Difference]: Without dead ends: 256 [2023-02-14 22:21:37,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=678, Invalid=2504, Unknown=10, NotChecked=0, Total=3192 [2023-02-14 22:21:37,230 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 279 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 22:21:37,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 91 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 22:21:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-14 22:21:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2023-02-14 22:21:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 156 states have internal predecessors, (203), 0 states have call successors, (0), 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-14 22:21:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2023-02-14 22:21:37,260 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 37 [2023-02-14 22:21:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:21:37,260 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2023-02-14 22:21:37,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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-14 22:21:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2023-02-14 22:21:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 22:21:37,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:21:37,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:21:37,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 22:21:37,466 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-14 22:21:37,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:21:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:21:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2023-02-14 22:21:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:21:37,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558074057] [2023-02-14 22:21:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:21:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:21:37,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:21:37,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825905717] [2023-02-14 22:21:37,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:21:37,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:21:37,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:21:37,503 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-14 22:21:37,504 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-14 22:21:37,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:21:37,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:21:37,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 22:21:37,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:21:37,591 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-14 22:21:37,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:21:37,628 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 25 treesize of output 24 [2023-02-14 22:21:37,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:21:37,657 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 25 treesize of output 24 [2023-02-14 22:21:37,673 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-14 22:21:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:37,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:21:37,712 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 16 treesize of output 14 [2023-02-14 22:21:37,713 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 20 treesize of output 16 [2023-02-14 22:21:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:21:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558074057] [2023-02-14 22:21:37,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:21:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825905717] [2023-02-14 22:21:37,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825905717] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:21:37,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:21:37,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-02-14 22:21:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479287898] [2023-02-14 22:21:37,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:21:37,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 22:21:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:21:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 22:21:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:21:37,735 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 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-14 22:21:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:21:37,947 INFO L93 Difference]: Finished difference Result 276 states and 365 transitions. [2023-02-14 22:21:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 22:21:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 22:21:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:21:37,949 INFO L225 Difference]: With dead ends: 276 [2023-02-14 22:21:37,949 INFO L226 Difference]: Without dead ends: 187 [2023-02-14 22:21:37,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-14 22:21:37,950 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:21:37,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 86 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:21:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-14 22:21:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 157. [2023-02-14 22:21:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.2884615384615385) internal successors, (201), 156 states have internal predecessors, (201), 0 states have call successors, (0), 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-14 22:21:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 201 transitions. [2023-02-14 22:21:37,977 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 201 transitions. Word has length 37 [2023-02-14 22:21:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:21:37,977 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 201 transitions. [2023-02-14 22:21:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 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-14 22:21:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2023-02-14 22:21:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 22:21:37,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:21:37,978 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:21:37,983 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-14 22:21:38,183 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-14 22:21:38,183 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:21:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:21:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2023-02-14 22:21:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:21:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264871582] [2023-02-14 22:21:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:21:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:21:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:21:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:21:38,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264871582] [2023-02-14 22:21:38,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264871582] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:21:38,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881097150] [2023-02-14 22:21:38,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:21:38,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:21:38,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:21:38,314 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-14 22:21:38,316 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-14 22:21:38,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:21:38,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:21:38,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 22:21:38,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:21:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:38,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:21:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:38,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881097150] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:21:38,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:21:38,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-14 22:21:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063510564] [2023-02-14 22:21:38,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:21:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 22:21:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:21:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 22:21:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:21:38,519 INFO L87 Difference]: Start difference. First operand 157 states and 201 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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-14 22:21:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:21:38,819 INFO L93 Difference]: Finished difference Result 212 states and 274 transitions. [2023-02-14 22:21:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 22:21:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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 39 [2023-02-14 22:21:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:21:38,821 INFO L225 Difference]: With dead ends: 212 [2023-02-14 22:21:38,821 INFO L226 Difference]: Without dead ends: 196 [2023-02-14 22:21:38,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 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-14 22:21:38,821 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:21:38,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 45 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:21:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-14 22:21:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 108. [2023-02-14 22:21:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 107 states have internal predecessors, (133), 0 states have call successors, (0), 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-14 22:21:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2023-02-14 22:21:38,861 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 39 [2023-02-14 22:21:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:21:38,861 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2023-02-14 22:21:38,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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-14 22:21:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2023-02-14 22:21:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 22:21:38,861 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:21:38,862 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:21:38,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 22:21:39,066 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-14 22:21:39,066 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:21:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:21:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2023-02-14 22:21:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:21:39,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058049119] [2023-02-14 22:21:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:21:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:21:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:21:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:39,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:21:39,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058049119] [2023-02-14 22:21:39,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058049119] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:21:39,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817129354] [2023-02-14 22:21:39,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:21:39,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:21:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:21:39,177 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-14 22:21:39,180 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-14 22:21:39,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 22:21:39,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:21:39,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 22:21:39,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:21:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:39,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:21:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 22:21:39,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817129354] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:21:39,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:21:39,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-14 22:21:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857965074] [2023-02-14 22:21:39,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:21:39,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 22:21:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:21:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 22:21:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:21:39,406 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 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-14 22:21:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:21:39,544 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2023-02-14 22:21:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 22:21:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 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 40 [2023-02-14 22:21:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:21:39,545 INFO L225 Difference]: With dead ends: 137 [2023-02-14 22:21:39,545 INFO L226 Difference]: Without dead ends: 61 [2023-02-14 22:21:39,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-02-14 22:21:39,545 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:21:39,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 26 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:21:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-14 22:21:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-02-14 22:21:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 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-14 22:21:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2023-02-14 22:21:39,566 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 40 [2023-02-14 22:21:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:21:39,566 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2023-02-14 22:21:39,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 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-14 22:21:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2023-02-14 22:21:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 22:21:39,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:21:39,567 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:21:39,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-14 22:21:39,772 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-14 22:21:39,773 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:21:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:21:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2023-02-14 22:21:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:21:39,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845201168] [2023-02-14 22:21:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:21:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:21:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:21:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 22:21:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:21:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845201168] [2023-02-14 22:21:40,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845201168] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:21:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210882082] [2023-02-14 22:21:40,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:21:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:21:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:21:40,954 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-14 22:21:40,957 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-14 22:21:41,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:21:41,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:21:41,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 69 conjunts are in the unsatisfiable core [2023-02-14 22:21:41,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:21:41,052 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-14 22:21:41,056 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-14 22:21:41,062 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-14 22:21:41,091 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-14 22:21:41,120 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-14 22:21:41,152 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-14 22:21:41,230 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-14 22:21:41,244 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-14 22:21:41,261 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-14 22:21:41,275 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-14 22:21:41,326 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-14 22:21:41,413 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:21:41,413 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-14 22:21:41,526 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:21:41,526 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 90 treesize of output 59 [2023-02-14 22:21:41,667 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:21:41,667 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 91 treesize of output 60 [2023-02-14 22:21:41,741 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:21:41,741 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 71 treesize of output 31 [2023-02-14 22:21:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 22:21:41,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:21:44,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 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 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 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| (+ .cse1 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= .cse0 2)) (= (* c_~N~0 2) (+ .cse1 .cse2 .cse0 .cse3 .cse4)) (not (= 2 .cse4)) (not (= 2 .cse3)) (not (= .cse2 2)))))))))) is different from false [2023-02-14 22:21:45,049 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 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_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (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 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (not (= 2 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (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 .cse5 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse2)) (< (+ .cse3 1) (+ .cse4 .cse5 .cse1 .cse0 .cse2)))))))) (not (= .cse5 2))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse9 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (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 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (not (= 2 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (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 .cse9 .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (< (+ .cse11 .cse9 .cse10 .cse8 .cse12) (+ .cse3 3)) (not (= 2 .cse12))))))))))))))))))) is different from false [2023-02-14 22:21:45,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 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_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse3 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (< (+ .cse0 .cse1 .cse2 .cse3 .cse4) (+ .cse5 5)) (not (= 2 .cse4))))) (not (= 2 .cse2))))) (not (= .cse1 2)))))))) (not (= 2 .cse3))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse9 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (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 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (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 .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (< (+ .cse5 3) (+ .cse10 .cse9 .cse11 .cse8 .cse12)) (not (= 2 .cse12))))) (not (= 2 .cse11)))))))))))))))) is different from false [2023-02-14 22:21:45,316 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 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_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse5 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse0 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse1)) (< (+ .cse2 5) (+ .cse3 .cse0 .cse4 .cse5 .cse1))))) (not (= 2 .cse4))))))))))) (not (= 2 .cse5))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (not (= 2 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (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 .cse11 .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse9)) (< (+ .cse10 .cse11 .cse8 .cse12 .cse9) (+ .cse2 7)))))))) (not (= .cse11 2)))))))) (not (= 2 .cse12))))))) is different from false [2023-02-14 22:21:45,463 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 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_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (not (= 2 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (not (= .cse1 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (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 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (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 .cse1 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse2)) (< (+ .cse3 7) (+ .cse4 .cse1 .cse5 .cse0 .cse2))))) (not (= 2 .cse5)))))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_236| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_236| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_228| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_226| Int)) (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 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int)) (let ((.cse8 (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 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (or (not (= 2 .cse8)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ .cse3 9))))) (not (= 2 .cse11))))) (not (= .cse10 2)))))))) (not (= 2 .cse12))))))) is different from false [2023-02-14 22:21:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2023-02-14 22:21:45,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210882082] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:21:45,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:21:45,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 52 [2023-02-14 22:21:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818697130] [2023-02-14 22:21:45,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:21:45,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 22:21:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:21:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 22:21:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1992, Unknown=6, NotChecked=470, Total=2652 [2023-02-14 22:21:45,554 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 52 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:06,628 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 66 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:22:17,017 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-14 22:22:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:18,430 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2023-02-14 22:22:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-14 22:22:18,431 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 22:22:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:18,431 INFO L225 Difference]: With dead ends: 155 [2023-02-14 22:22:18,431 INFO L226 Difference]: Without dead ends: 151 [2023-02-14 22:22:18,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=662, Invalid=5991, Unknown=9, NotChecked=820, Total=7482 [2023-02-14 22:22:18,433 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 124 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 432 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:18,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 333 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1631 Invalid, 12 Unknown, 432 Unchecked, 3.6s Time] [2023-02-14 22:22:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-14 22:22:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2023-02-14 22:22:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 117 states have internal predecessors, (146), 0 states have call successors, (0), 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-14 22:22:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2023-02-14 22:22:18,467 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 45 [2023-02-14 22:22:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:18,468 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2023-02-14 22:22:18,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 52 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2023-02-14 22:22:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 22:22:18,468 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:18,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:18,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:18,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 22:22:18,674 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 3 times [2023-02-14 22:22:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:18,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015813003] [2023-02-14 22:22:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:18,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:22:18,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539555705] [2023-02-14 22:22:18,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:22:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:18,697 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:18,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-14 22:22:18,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 22:22:18,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:18,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 22:22:18,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:18,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-02-14 22:22:18,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:18,901 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-14 22:22:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:18,922 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-14 22:22:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:18,943 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-14 22:22:18,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:18,967 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-14 22:22:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-14 22:22:19,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:20,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:20,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2023-02-14 22:22:20,698 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-14 22:22:20,698 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-14 22:22:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-14 22:22:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:22,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015813003] [2023-02-14 22:22:22,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:22:22,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539555705] [2023-02-14 22:22:22,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539555705] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:22,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:22:22,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-14 22:22:22,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857088998] [2023-02-14 22:22:22,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:22,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 22:22:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:22,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 22:22:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=231, Unknown=3, NotChecked=0, Total=306 [2023-02-14 22:22:22,761 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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-14 22:22:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:23,152 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2023-02-14 22:22:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 22:22:23,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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 45 [2023-02-14 22:22:23,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:23,159 INFO L225 Difference]: With dead ends: 192 [2023-02-14 22:22:23,159 INFO L226 Difference]: Without dead ends: 188 [2023-02-14 22:22:23,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=177, Invalid=470, Unknown=3, NotChecked=0, Total=650 [2023-02-14 22:22:23,160 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:23,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:22:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-14 22:22:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2023-02-14 22:22:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 168 states have internal predecessors, (216), 0 states have call successors, (0), 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-14 22:22:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2023-02-14 22:22:23,222 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 45 [2023-02-14 22:22:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:23,222 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 216 transitions. [2023-02-14 22:22:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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-14 22:22:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 216 transitions. [2023-02-14 22:22:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 22:22:23,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:23,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:23,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:23,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:23,429 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 4 times [2023-02-14 22:22:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:23,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170608828] [2023-02-14 22:22:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:23,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:22:23,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45186944] [2023-02-14 22:22:23,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:22:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:23,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:23,472 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:23,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-14 22:22:23,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:22:23,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:23,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-14 22:22:23,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:23,580 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-14 22:22:23,635 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 37 treesize of output 17 [2023-02-14 22:22:23,670 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-14 22:22:23,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 1 case distinctions, treesize of input 25 treesize of output 24 [2023-02-14 22:22:23,705 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-14 22:22:23,728 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-14 22:22:23,749 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 19 treesize of output 7 [2023-02-14 22:22:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 22:22:23,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:23,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2023-02-14 22:22:23,974 INFO L321 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2023-02-14 22:22:23,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2023-02-14 22:22:23,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:23,979 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-14 22:22:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 20 refuted. 2 times theorem prover too weak. 18 trivial. 7 not checked. [2023-02-14 22:22:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170608828] [2023-02-14 22:22:24,011 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:22:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45186944] [2023-02-14 22:22:24,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45186944] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:24,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:22:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2023-02-14 22:22:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157108376] [2023-02-14 22:22:24,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 22:22:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 22:22:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=378, Unknown=6, NotChecked=40, Total=506 [2023-02-14 22:22:24,012 INFO L87 Difference]: Start difference. First operand 169 states and 216 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-14 22:22:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:24,336 INFO L93 Difference]: Finished difference Result 202 states and 263 transitions. [2023-02-14 22:22:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 22:22:24,341 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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 45 [2023-02-14 22:22:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:24,342 INFO L225 Difference]: With dead ends: 202 [2023-02-14 22:22:24,342 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 22:22:24,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=452, Unknown=6, NotChecked=44, Total=600 [2023-02-14 22:22:24,343 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:24,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 538 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2023-02-14 22:22:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 22:22:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2023-02-14 22:22:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 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-14 22:22:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2023-02-14 22:22:24,391 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 45 [2023-02-14 22:22:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:24,391 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2023-02-14 22:22:24,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-14 22:22:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2023-02-14 22:22:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 22:22:24,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:24,392 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:24,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:24,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:24,597 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2023-02-14 22:22:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:24,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879948199] [2023-02-14 22:22:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:24,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:22:24,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029593855] [2023-02-14 22:22:24,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:22:24,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:24,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:24,618 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:24,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-14 22:22:24,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 22:22:24,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:24,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 22:22:24,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:24,755 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-14 22:22:24,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:24,840 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 27 treesize of output 26 [2023-02-14 22:22:24,892 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-14 22:22:24,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2023-02-14 22:22:24,954 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-14 22:22:24,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2023-02-14 22:22:25,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:25,032 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 35 treesize of output 35 [2023-02-14 22:22:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 22:22:25,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:41,074 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 25 treesize of output 23 [2023-02-14 22:22:41,079 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 68 treesize of output 62 [2023-02-14 22:22:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 22:22:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:41,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879948199] [2023-02-14 22:22:41,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:22:41,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029593855] [2023-02-14 22:22:41,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029593855] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:41,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:22:41,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2023-02-14 22:22:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492275035] [2023-02-14 22:22:41,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:41,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-14 22:22:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-14 22:22:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=979, Unknown=5, NotChecked=0, Total=1260 [2023-02-14 22:22:41,088 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:42,129 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2023-02-14 22:22:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 22:22:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 22:22:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:42,130 INFO L225 Difference]: With dead ends: 164 [2023-02-14 22:22:42,130 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 22:22:42,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=759, Invalid=2658, Unknown=5, NotChecked=0, Total=3422 [2023-02-14 22:22:42,131 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 116 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:42,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 46 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 22:22:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 22:22:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-14 22:22:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 114 states have internal predecessors, (136), 0 states have call successors, (0), 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-14 22:22:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2023-02-14 22:22:42,158 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 45 [2023-02-14 22:22:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:42,159 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2023-02-14 22:22:42,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2023-02-14 22:22:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-14 22:22:42,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:42,159 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:42,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-02-14 22:22:42,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:42,364 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2023-02-14 22:22:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048493740] [2023-02-14 22:22:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 22:22:42,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:42,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048493740] [2023-02-14 22:22:42,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048493740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:42,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770172767] [2023-02-14 22:22:42,512 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:22:42,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:42,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:42,514 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:42,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-14 22:22:42,636 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-14 22:22:42,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:42,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 22:22:42,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 22:22:42,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 22:22:42,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770172767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:42,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:42,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-14 22:22:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798407247] [2023-02-14 22:22:42,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:42,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 22:22:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 22:22:42,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-14 22:22:42,852 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 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-14 22:22:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:43,149 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2023-02-14 22:22:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 22:22:43,151 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 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 47 [2023-02-14 22:22:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:43,152 INFO L225 Difference]: With dead ends: 177 [2023-02-14 22:22:43,152 INFO L226 Difference]: Without dead ends: 159 [2023-02-14 22:22:43,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 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-14 22:22:43,152 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:43,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 28 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:22:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-14 22:22:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2023-02-14 22:22:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 106 states have internal predecessors, (128), 0 states have call successors, (0), 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-14 22:22:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-14 22:22:43,208 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 47 [2023-02-14 22:22:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:43,208 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-14 22:22:43,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 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-14 22:22:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-14 22:22:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 22:22:43,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:43,209 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:43,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:43,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-14 22:22:43,415 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2023-02-14 22:22:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:43,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610199030] [2023-02-14 22:22:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 22:22:43,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610199030] [2023-02-14 22:22:43,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610199030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035910817] [2023-02-14 22:22:43,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 22:22:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:43,566 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:43,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 22:22:43,692 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-14 22:22:43,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:43,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 22:22:43,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-14 22:22:43,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-14 22:22:43,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035910817] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:43,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:43,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-14 22:22:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106782656] [2023-02-14 22:22:43,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:43,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 22:22:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 22:22:43,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-14 22:22:43,870 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:44,070 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2023-02-14 22:22:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 22:22:44,071 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-14 22:22:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:44,071 INFO L225 Difference]: With dead ends: 163 [2023-02-14 22:22:44,071 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 22:22:44,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2023-02-14 22:22:44,072 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:44,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 24 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:22:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 22:22:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2023-02-14 22:22:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-02-14 22:22:44,086 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 48 [2023-02-14 22:22:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:44,087 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-02-14 22:22:44,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-02-14 22:22:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 22:22:44,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:44,087 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:44,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:44,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-14 22:22:44,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2023-02-14 22:22:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:44,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247046551] [2023-02-14 22:22:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-14 22:22:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247046551] [2023-02-14 22:22:45,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247046551] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655077705] [2023-02-14 22:22:45,232 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 22:22:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:45,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:45,233 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:45,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-14 22:22:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:45,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-14 22:22:45,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:45,410 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-14 22:22:45,415 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-14 22:22:45,448 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-14 22:22:45,504 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-14 22:22:45,545 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-14 22:22:45,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 14 treesize of output 16 [2023-02-14 22:22:45,637 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-14 22:22:45,743 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-14 22:22:45,761 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-14 22:22:45,782 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-14 22:22:45,801 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-14 22:22:45,819 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-14 22:22:45,887 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-14 22:22:46,000 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:22:46,000 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-14 22:22:46,137 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:22:46,138 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-14 22:22:46,280 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:22:46,280 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-14 22:22:46,440 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:22:46,441 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 91 treesize of output 60 [2023-02-14 22:22:46,553 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:22:46,554 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 94 treesize of output 38 [2023-02-14 22:22:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-14 22:22:46,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:56,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_358| Int) (v_ArrVal_1169 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_354| Int) (|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1169))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_1169 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 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| (+ .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_358| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_356| 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| (+ .cse3 .cse4 .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_354| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (not (= .cse2 2)) (not (= 2 .cse3)) (= (* c_~N~0 2) (+ .cse2 .cse3 .cse4 .cse0 .cse5 .cse1)) (not (= 2 .cse4))))))))))) is different from false [2023-02-14 22:23:00,146 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 22:23:00,146 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 1901 treesize of output 1 [2023-02-14 22:23:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 26 trivial. 9 not checked. [2023-02-14 22:23:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655077705] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:23:00,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:23:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 22] total 65 [2023-02-14 22:23:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147263038] [2023-02-14 22:23:00,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:23:00,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-14 22:23:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:23:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-14 22:23:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3771, Unknown=6, NotChecked=124, Total=4160 [2023-02-14 22:23:00,152 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)