/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/array-fpi/s4if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-30 22:35:11,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-30 22:35:11,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-30 22:35:11,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-30 22:35:11,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-30 22:35:11,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-30 22:35:11,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-30 22:35:11,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-30 22:35:11,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-30 22:35:11,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-30 22:35:11,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-30 22:35:11,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-30 22:35:11,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-30 22:35:11,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-30 22:35:11,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-30 22:35:11,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-30 22:35:11,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-30 22:35:11,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-30 22:35:11,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-30 22:35:11,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-30 22:35:11,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-30 22:35:11,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-30 22:35:11,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-30 22:35:11,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-30 22:35:11,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-30 22:35:11,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-30 22:35:11,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-30 22:35:11,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-30 22:35:11,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-30 22:35:11,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-30 22:35:11,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-30 22:35:11,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-30 22:35:11,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-30 22:35:11,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-30 22:35:11,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-30 22:35:11,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-30 22:35:11,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-30 22:35:11,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-30 22:35:11,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-30 22:35:11,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-30 22:35:11,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-30 22:35:11,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-30 22:35:11,311 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-30 22:35:11,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-30 22:35:11,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-30 22:35:11,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-30 22:35:11,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-30 22:35:11,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-30 22:35:11,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-30 22:35:11,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-30 22:35:11,313 INFO L138 SettingsManager]: * Use SBE=true [2023-03-30 22:35:11,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-30 22:35:11,314 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-30 22:35:11,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-30 22:35:11,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-30 22:35:11,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-30 22:35:11,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-30 22:35:11,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 22:35:11,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-30 22:35:11,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-30 22:35:11,317 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-30 22:35:11,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-30 22:35:11,317 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-30 22:35:11,317 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 [2023-03-30 22:35:11,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-30 22:35:11,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-30 22:35:11,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-30 22:35:11,508 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-30 22:35:11,509 INFO L275 PluginConnector]: CDTParser initialized [2023-03-30 22:35:11,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2023-03-30 22:35:12,391 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-30 22:35:12,556 INFO L351 CDTParser]: Found 1 translation units. [2023-03-30 22:35:12,557 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2023-03-30 22:35:12,560 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e28a3704/4be1318af22d4ac88602f1b4f9bd4bf7/FLAG6bf25777c [2023-03-30 22:35:12,569 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e28a3704/4be1318af22d4ac88602f1b4f9bd4bf7 [2023-03-30 22:35:12,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-30 22:35:12,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-30 22:35:12,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-30 22:35:12,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-30 22:35:12,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-30 22:35:12,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a876ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12, skipping insertion in model container [2023-03-30 22:35:12,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-30 22:35:12,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-30 22:35:12,703 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2023-03-30 22:35:12,721 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 22:35:12,730 INFO L203 MainTranslator]: Completed pre-run [2023-03-30 22:35:12,743 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2023-03-30 22:35:12,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 22:35:12,765 INFO L208 MainTranslator]: Completed translation [2023-03-30 22:35:12,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12 WrapperNode [2023-03-30 22:35:12,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-30 22:35:12,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-30 22:35:12,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-30 22:35:12,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-30 22:35:12,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,787 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-30 22:35:12,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-30 22:35:12,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-30 22:35:12,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-30 22:35:12,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (1/1) ... [2023-03-30 22:35:12,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 22:35:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:12,817 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-03-30 22:35:12,820 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-03-30 22:35:12,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-30 22:35:12,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-30 22:35:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-30 22:35:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-30 22:35:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-03-30 22:35:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-30 22:35:12,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-30 22:35:12,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-30 22:35:12,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-30 22:35:12,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-30 22:35:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-30 22:35:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-30 22:35:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-30 22:35:12,897 INFO L236 CfgBuilder]: Building ICFG [2023-03-30 22:35:12,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-30 22:35:13,029 INFO L277 CfgBuilder]: Performing block encoding [2023-03-30 22:35:13,033 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-30 22:35:13,033 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-30 22:35:13,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 10:35:13 BoogieIcfgContainer [2023-03-30 22:35:13,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-30 22:35:13,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-30 22:35:13,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-30 22:35:13,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-30 22:35:13,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.03 10:35:12" (1/3) ... [2023-03-30 22:35:13,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44709fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 10:35:13, skipping insertion in model container [2023-03-30 22:35:13,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:35:12" (2/3) ... [2023-03-30 22:35:13,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44709fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 10:35:13, skipping insertion in model container [2023-03-30 22:35:13,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 10:35:13" (3/3) ... [2023-03-30 22:35:13,040 INFO L112 eAbstractionObserver]: Analyzing ICFG s4if.c [2023-03-30 22:35:13,053 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-30 22:35:13,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-30 22:35:13,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-30 22:35:13,100 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;@1c076118, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-30 22:35:13,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-30 22:35:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-03-30 22:35:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-30 22:35:13,107 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:13,108 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-03-30 22:35:13,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:13,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 863653859, now seen corresponding path program 1 times [2023-03-30 22:35:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:13,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527865673] [2023-03-30 22:35:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:13,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:13,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527865673] [2023-03-30 22:35:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527865673] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:35:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:35:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-30 22:35:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481561862] [2023-03-30 22:35:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:35:13,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-30 22:35:13,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-30 22:35:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-30 22:35:13,320 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:13,377 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-03-30 22:35:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-30 22:35:13,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-03-30 22:35:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:13,383 INFO L225 Difference]: With dead ends: 54 [2023-03-30 22:35:13,383 INFO L226 Difference]: Without dead ends: 25 [2023-03-30 22:35:13,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-30 22:35:13,388 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:13,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 22:35:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-03-30 22:35:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-03-30 22:35:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-03-30 22:35:13,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2023-03-30 22:35:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:13,422 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-03-30 22:35:13,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-03-30 22:35:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-30 22:35:13,424 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:13,425 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-03-30 22:35:13,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-30 22:35:13,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:13,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1121819297, now seen corresponding path program 1 times [2023-03-30 22:35:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:13,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820762292] [2023-03-30 22:35:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:13,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:13,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820762292] [2023-03-30 22:35:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820762292] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:35:13,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:35:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-30 22:35:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233893875] [2023-03-30 22:35:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:35:13,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-30 22:35:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-30 22:35:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-03-30 22:35:13,598 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:13,663 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-03-30 22:35:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-30 22:35:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-03-30 22:35:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:13,669 INFO L225 Difference]: With dead ends: 40 [2023-03-30 22:35:13,669 INFO L226 Difference]: Without dead ends: 30 [2023-03-30 22:35:13,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-03-30 22:35:13,671 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:13,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 17 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 22:35:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-03-30 22:35:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-03-30 22:35:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-03-30 22:35:13,677 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2023-03-30 22:35:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:13,677 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-03-30 22:35:13,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-03-30 22:35:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-03-30 22:35:13,678 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:13,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:13,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-30 22:35:13,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:13,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -667943349, now seen corresponding path program 1 times [2023-03-30 22:35:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:13,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485975139] [2023-03-30 22:35:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485975139] [2023-03-30 22:35:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485975139] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698538558] [2023-03-30 22:35:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:14,268 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-03-30 22:35:14,300 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-03-30 22:35:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:14,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2023-03-30 22:35:14,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:14,446 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-03-30 22:35:14,457 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-03-30 22:35:14,503 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-03-30 22:35:14,637 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 30 treesize of output 25 [2023-03-30 22:35:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:14,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:14,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:14,982 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 22 treesize of output 23 [2023-03-30 22:35:14,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-30 22:35:14,987 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 20 treesize of output 12 [2023-03-30 22:35:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:15,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698538558] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:15,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 33 [2023-03-30 22:35:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865198948] [2023-03-30 22:35:15,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:15,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-03-30 22:35:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-03-30 22:35:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=862, Unknown=1, NotChecked=0, Total=1056 [2023-03-30 22:35:15,094 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 33 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-30 22:35:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:15,733 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-03-30 22:35:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-30 22:35:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-03-30 22:35:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:15,735 INFO L225 Difference]: With dead ends: 47 [2023-03-30 22:35:15,735 INFO L226 Difference]: Without dead ends: 41 [2023-03-30 22:35:15,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=1695, Unknown=1, NotChecked=0, Total=2070 [2023-03-30 22:35:15,737 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:15,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 71 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-30 22:35:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-03-30 22:35:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2023-03-30 22:35:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-03-30 22:35:15,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 26 [2023-03-30 22:35:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:15,744 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-03-30 22:35:15,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-30 22:35:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-03-30 22:35:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-03-30 22:35:15,750 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:15,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:15,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-03-30 22:35:15,956 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-03-30 22:35:15,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:15,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1477289975, now seen corresponding path program 1 times [2023-03-30 22:35:15,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:15,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738597176] [2023-03-30 22:35:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:15,974 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:35:15,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763956111] [2023-03-30 22:35:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:15,975 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-03-30 22:35:15,977 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-03-30 22:35:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:16,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2023-03-30 22:35:16,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:16,043 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-03-30 22:35:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:16,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:16,097 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-03-30 22:35:16,099 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 14 treesize of output 12 [2023-03-30 22:35:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:16,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:16,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738597176] [2023-03-30 22:35:16,113 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:35:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763956111] [2023-03-30 22:35:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763956111] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:16,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:35:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-03-30 22:35:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402135858] [2023-03-30 22:35:16,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:16,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-30 22:35:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-30 22:35:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-03-30 22:35:16,116 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:16,166 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-03-30 22:35:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-30 22:35:16,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-03-30 22:35:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:16,168 INFO L225 Difference]: With dead ends: 50 [2023-03-30 22:35:16,170 INFO L226 Difference]: Without dead ends: 36 [2023-03-30 22:35:16,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-03-30 22:35:16,177 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:16,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 22:35:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-03-30 22:35:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-03-30 22:35:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-03-30 22:35:16,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2023-03-30 22:35:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:16,190 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-03-30 22:35:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-03-30 22:35:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-03-30 22:35:16,191 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:16,192 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, 1, 1, 1, 1, 1] [2023-03-30 22:35:16,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-30 22:35:16,397 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-03-30 22:35:16,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:16,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1722810441, now seen corresponding path program 2 times [2023-03-30 22:35:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818803181] [2023-03-30 22:35:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:16,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818803181] [2023-03-30 22:35:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818803181] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889580662] [2023-03-30 22:35:16,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:35:16,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:16,470 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-03-30 22:35:16,473 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-03-30 22:35:16,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:35:16,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:16,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-30 22:35:16,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:16,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889580662] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:16,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-03-30 22:35:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874753181] [2023-03-30 22:35:16,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:16,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-30 22:35:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-30 22:35:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-03-30 22:35:16,604 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:16,724 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-03-30 22:35:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-30 22:35:16,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-03-30 22:35:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:16,726 INFO L225 Difference]: With dead ends: 45 [2023-03-30 22:35:16,726 INFO L226 Difference]: Without dead ends: 39 [2023-03-30 22:35:16,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-03-30 22:35:16,727 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:16,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 43 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:35:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-03-30 22:35:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2023-03-30 22:35:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-03-30 22:35:16,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2023-03-30 22:35:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:16,735 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-03-30 22:35:16,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-03-30 22:35:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-03-30 22:35:16,736 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:16,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:16,744 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-03-30 22:35:16,941 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-03-30 22:35:16,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:16,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1559730403, now seen corresponding path program 3 times [2023-03-30 22:35:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879424836] [2023-03-30 22:35:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:17,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879424836] [2023-03-30 22:35:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879424836] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414511386] [2023-03-30 22:35:17,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-30 22:35:17,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:17,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:17,031 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-03-30 22:35:17,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-30 22:35:17,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-30 22:35:17,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:17,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-30 22:35:17,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:17,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:17,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414511386] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:17,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:17,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-03-30 22:35:17,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379418900] [2023-03-30 22:35:17,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:17,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-30 22:35:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-30 22:35:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-03-30 22:35:17,149 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:17,231 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-03-30 22:35:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-30 22:35:17,231 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-03-30 22:35:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:17,232 INFO L225 Difference]: With dead ends: 49 [2023-03-30 22:35:17,232 INFO L226 Difference]: Without dead ends: 35 [2023-03-30 22:35:17,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-03-30 22:35:17,233 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:17,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 22:35:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-03-30 22:35:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-03-30 22:35:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-03-30 22:35:17,237 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2023-03-30 22:35:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:17,237 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-03-30 22:35:17,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-03-30 22:35:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-30 22:35:17,238 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:17,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:17,246 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-03-30 22:35:17,443 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-03-30 22:35:17,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:17,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1063218725, now seen corresponding path program 4 times [2023-03-30 22:35:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019264624] [2023-03-30 22:35:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:18,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:18,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019264624] [2023-03-30 22:35:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019264624] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329703273] [2023-03-30 22:35:18,262 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-30 22:35:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:18,263 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-03-30 22:35:18,265 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-03-30 22:35:18,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-30 22:35:18,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:18,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2023-03-30 22:35:18,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:18,325 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-03-30 22:35:18,329 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-03-30 22:35:18,351 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-03-30 22:35:18,385 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-03-30 22:35:18,500 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 30 treesize of output 25 [2023-03-30 22:35:18,615 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:35:18,615 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 41 treesize of output 39 [2023-03-30 22:35:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:18,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:19,124 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 4))) (and (forall ((v_main_~i~0_47 Int) (main_~a~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_main_~i~0_44 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_155))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))) 4)) (not (= 4 (select v_ArrVal_155 (+ main_~a~0.offset (* v_main_~i~0_47 4))))) (< .cse3 (+ .cse2 5))))))) (forall ((v_main_~i~0_47 Int) (main_~a~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_main_~i~0_44 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_155))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))) 4)) (not (= 4 (select v_ArrVal_155 (+ main_~a~0.offset (* v_main_~i~0_47 4))))) (< (+ .cse6 3) .cse3)))))))) is different from false [2023-03-30 22:35:19,151 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 4))) (and (forall ((v_main_~i~0_47 Int) (main_~a~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_main_~i~0_44 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_155))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))) 4)) (not (= 4 (select v_ArrVal_155 (+ main_~a~0.offset (* v_main_~i~0_47 4))))) (< .cse3 (+ .cse2 1))))))) (forall ((v_main_~i~0_47 Int) (main_~a~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_main_~i~0_44 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_155))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))) 4)) (< .cse6 (+ .cse3 1)) (not (= 4 (select v_ArrVal_155 (+ main_~a~0.offset (* v_main_~i~0_47 4)))))))))))) is different from false [2023-03-30 22:35:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-03-30 22:35:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329703273] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:19,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2023-03-30 22:35:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699807669] [2023-03-30 22:35:19,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:19,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-03-30 22:35:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-03-30 22:35:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1197, Unknown=2, NotChecked=142, Total=1482 [2023-03-30 22:35:19,193 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 39 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:20,230 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-03-30 22:35:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-03-30 22:35:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-03-30 22:35:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:20,231 INFO L225 Difference]: With dead ends: 52 [2023-03-30 22:35:20,231 INFO L226 Difference]: Without dead ends: 46 [2023-03-30 22:35:20,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=2193, Unknown=2, NotChecked=194, Total=2652 [2023-03-30 22:35:20,232 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:20,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 609 Invalid, 0 Unknown, 85 Unchecked, 0.5s Time] [2023-03-30 22:35:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-03-30 22:35:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-03-30 22:35:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-03-30 22:35:20,238 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2023-03-30 22:35:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:20,238 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-03-30 22:35:20,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-03-30 22:35:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-30 22:35:20,239 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:20,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:20,245 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-03-30 22:35:20,445 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-03-30 22:35:20,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:20,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash 253872099, now seen corresponding path program 1 times [2023-03-30 22:35:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:20,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462912069] [2023-03-30 22:35:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:20,454 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:35:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039153963] [2023-03-30 22:35:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:20,455 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-03-30 22:35:20,457 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-03-30 22:35:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:20,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2023-03-30 22:35:20,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:20,553 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-03-30 22:35:20,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:35:20,596 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-03-30 22:35:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:20,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:20,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:20,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-03-30 22:35:20,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:20,697 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 32 [2023-03-30 22:35:20,700 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-03-30 22:35:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462912069] [2023-03-30 22:35:20,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:35:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039153963] [2023-03-30 22:35:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039153963] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:20,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:35:20,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-03-30 22:35:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139259645] [2023-03-30 22:35:20,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:20,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-30 22:35:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:20,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-30 22:35:20,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=165, Unknown=5, NotChecked=0, Total=210 [2023-03-30 22:35:20,739 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:20,866 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-03-30 22:35:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-30 22:35:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-03-30 22:35:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:20,867 INFO L225 Difference]: With dead ends: 53 [2023-03-30 22:35:20,867 INFO L226 Difference]: Without dead ends: 44 [2023-03-30 22:35:20,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=267, Unknown=5, NotChecked=0, Total=342 [2023-03-30 22:35:20,867 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:20,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 188 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:35:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-03-30 22:35:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-03-30 22:35:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-03-30 22:35:20,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2023-03-30 22:35:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:20,874 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-03-30 22:35:20,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-03-30 22:35:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-03-30 22:35:20,874 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:20,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:20,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-30 22:35:21,079 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-03-30 22:35:21,080 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:21,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash 656866023, now seen corresponding path program 5 times [2023-03-30 22:35:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677512977] [2023-03-30 22:35:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:21,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:21,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677512977] [2023-03-30 22:35:21,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677512977] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:21,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115300248] [2023-03-30 22:35:21,159 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-03-30 22:35:21,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:21,161 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-03-30 22:35:21,163 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-03-30 22:35:21,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-03-30 22:35:21,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:21,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-30 22:35:21,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:21,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115300248] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:21,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:21,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-03-30 22:35:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733482885] [2023-03-30 22:35:21,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:21,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-30 22:35:21,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-30 22:35:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-03-30 22:35:21,333 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:21,493 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-03-30 22:35:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-30 22:35:21,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-03-30 22:35:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:21,494 INFO L225 Difference]: With dead ends: 53 [2023-03-30 22:35:21,494 INFO L226 Difference]: Without dead ends: 47 [2023-03-30 22:35:21,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-03-30 22:35:21,495 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:21,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:35:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-03-30 22:35:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-03-30 22:35:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-03-30 22:35:21,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2023-03-30 22:35:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:21,500 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-03-30 22:35:21,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-03-30 22:35:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-03-30 22:35:21,501 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:21,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:21,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-03-30 22:35:21,701 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-03-30 22:35:21,701 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:21,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 641786569, now seen corresponding path program 6 times [2023-03-30 22:35:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953843617] [2023-03-30 22:35:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:21,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953843617] [2023-03-30 22:35:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953843617] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164581032] [2023-03-30 22:35:21,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-03-30 22:35:21,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:21,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:21,786 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-03-30 22:35:21,788 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-03-30 22:35:21,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-03-30 22:35:21,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:21,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-30 22:35:21,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:21,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164581032] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:21,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-03-30 22:35:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115056230] [2023-03-30 22:35:21,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:21,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-30 22:35:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-30 22:35:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-03-30 22:35:21,959 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:22,082 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-03-30 22:35:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-30 22:35:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-03-30 22:35:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:22,083 INFO L225 Difference]: With dead ends: 57 [2023-03-30 22:35:22,083 INFO L226 Difference]: Without dead ends: 40 [2023-03-30 22:35:22,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-03-30 22:35:22,084 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:22,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:35:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-03-30 22:35:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-03-30 22:35:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-03-30 22:35:22,093 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2023-03-30 22:35:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:22,093 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-03-30 22:35:22,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-03-30 22:35:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-03-30 22:35:22,094 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:22,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:22,101 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-03-30 22:35:22,299 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-03-30 22:35:22,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:22,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1793718585, now seen corresponding path program 7 times [2023-03-30 22:35:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440330086] [2023-03-30 22:35:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:22,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440330086] [2023-03-30 22:35:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440330086] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975257492] [2023-03-30 22:35:22,954 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-03-30 22:35:22,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:22,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:22,955 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-03-30 22:35:22,957 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-03-30 22:35:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:23,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 59 conjunts are in the unsatisfiable core [2023-03-30 22:35:23,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:23,076 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-03-30 22:35:23,079 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-03-30 22:35:23,111 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-03-30 22:35:23,143 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-03-30 22:35:23,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:35:23,300 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 30 treesize of output 25 [2023-03-30 22:35:23,393 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:35:23,394 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 41 treesize of output 39 [2023-03-30 22:35:23,499 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:35:23,500 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 41 treesize of output 39 [2023-03-30 22:35:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:23,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:24,721 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:35:24,721 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 141 treesize of output 1 [2023-03-30 22:35:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:24,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975257492] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:24,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:24,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 17] total 50 [2023-03-30 22:35:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341618571] [2023-03-30 22:35:24,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-03-30 22:35:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:24,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-03-30 22:35:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2250, Unknown=0, NotChecked=0, Total=2450 [2023-03-30 22:35:24,742 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 50 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 46 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-30 22:35:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:27,386 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-03-30 22:35:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-03-30 22:35:27,387 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 46 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-03-30 22:35:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:27,387 INFO L225 Difference]: With dead ends: 60 [2023-03-30 22:35:27,387 INFO L226 Difference]: Without dead ends: 54 [2023-03-30 22:35:27,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=417, Invalid=4413, Unknown=0, NotChecked=0, Total=4830 [2023-03-30 22:35:27,389 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 36 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:27,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 121 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1096 Invalid, 3 Unknown, 0 Unchecked, 1.4s Time] [2023-03-30 22:35:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-03-30 22:35:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-03-30 22:35:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-03-30 22:35:27,397 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2023-03-30 22:35:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:27,397 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-03-30 22:35:27,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 46 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-30 22:35:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-03-30 22:35:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-03-30 22:35:27,398 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:27,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:27,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-03-30 22:35:27,606 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-03-30 22:35:27,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:27,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1691902085, now seen corresponding path program 2 times [2023-03-30 22:35:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998898528] [2023-03-30 22:35:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:27,614 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:35:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682712265] [2023-03-30 22:35:27,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:35:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:27,615 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-03-30 22:35:27,617 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-03-30 22:35:27,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:35:27,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:27,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjunts are in the unsatisfiable core [2023-03-30 22:35:27,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:27,717 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-03-30 22:35:27,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:35:27,763 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-03-30 22:35:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:35:27,789 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-03-30 22:35:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:27,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:27,895 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_353 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_353) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2023-03-30 22:35:27,902 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_353 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_353) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) is different from false [2023-03-30 22:35:27,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:27,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-03-30 22:35:27,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:27,917 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 32 [2023-03-30 22:35:27,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-03-30 22:35:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-03-30 22:35:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998898528] [2023-03-30 22:35:27,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:35:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682712265] [2023-03-30 22:35:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682712265] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:27,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:35:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-03-30 22:35:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370347852] [2023-03-30 22:35:27,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:27,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-30 22:35:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-30 22:35:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=226, Unknown=4, NotChecked=62, Total=342 [2023-03-30 22:35:27,979 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:28,136 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-03-30 22:35:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-30 22:35:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-03-30 22:35:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:28,137 INFO L225 Difference]: With dead ends: 61 [2023-03-30 22:35:28,137 INFO L226 Difference]: Without dead ends: 52 [2023-03-30 22:35:28,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=384, Unknown=4, NotChecked=82, Total=552 [2023-03-30 22:35:28,138 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:28,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 216 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 214 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2023-03-30 22:35:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-03-30 22:35:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-03-30 22:35:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-03-30 22:35:28,146 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 36 [2023-03-30 22:35:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:28,146 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-03-30 22:35:28,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-03-30 22:35:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-03-30 22:35:28,147 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:28,147 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:28,154 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-03-30 22:35:28,351 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-03-30 22:35:28,351 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:28,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1556995259, now seen corresponding path program 8 times [2023-03-30 22:35:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:28,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66170416] [2023-03-30 22:35:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:28,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:28,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66170416] [2023-03-30 22:35:28,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66170416] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:28,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424721831] [2023-03-30 22:35:28,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:35:28,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:28,478 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-03-30 22:35:28,480 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-03-30 22:35:28,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:35:28,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:28,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2023-03-30 22:35:28,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:28,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424721831] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:28,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-03-30 22:35:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922860043] [2023-03-30 22:35:28,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:28,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-30 22:35:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-30 22:35:28,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-03-30 22:35:28,682 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:28,906 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-03-30 22:35:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-03-30 22:35:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2023-03-30 22:35:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:28,907 INFO L225 Difference]: With dead ends: 61 [2023-03-30 22:35:28,907 INFO L226 Difference]: Without dead ends: 55 [2023-03-30 22:35:28,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2023-03-30 22:35:28,908 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:28,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 72 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 22:35:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-03-30 22:35:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2023-03-30 22:35:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-03-30 22:35:28,913 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2023-03-30 22:35:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:28,913 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-03-30 22:35:28,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-03-30 22:35:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-03-30 22:35:28,914 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:28,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:28,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-03-30 22:35:29,118 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-03-30 22:35:29,119 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:29,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1305678105, now seen corresponding path program 9 times [2023-03-30 22:35:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:29,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948003146] [2023-03-30 22:35:29,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:29,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:29,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948003146] [2023-03-30 22:35:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948003146] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557896603] [2023-03-30 22:35:29,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-30 22:35:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:29,221 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-03-30 22:35:29,223 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-03-30 22:35:29,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-03-30 22:35:29,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:29,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-03-30 22:35:29,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:29,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:29,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557896603] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:29,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-03-30 22:35:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137313430] [2023-03-30 22:35:29,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:29,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-30 22:35:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:29,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-30 22:35:29,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-03-30 22:35:29,422 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:35:29,570 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2023-03-30 22:35:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-30 22:35:29,570 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-03-30 22:35:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:35:29,570 INFO L225 Difference]: With dead ends: 65 [2023-03-30 22:35:29,570 INFO L226 Difference]: Without dead ends: 45 [2023-03-30 22:35:29,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-03-30 22:35:29,571 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:35:29,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 72 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:35:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-03-30 22:35:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-03-30 22:35:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 22:35:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2023-03-30 22:35:29,578 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2023-03-30 22:35:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:35:29,578 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-03-30 22:35:29,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2023-03-30 22:35:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-03-30 22:35:29,580 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:35:29,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:35:29,585 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-03-30 22:35:29,785 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-03-30 22:35:29,785 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:35:29,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:35:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1417373271, now seen corresponding path program 10 times [2023-03-30 22:35:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:35:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192119866] [2023-03-30 22:35:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:35:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:35:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:35:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:35:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:35:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:35:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:35:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192119866] [2023-03-30 22:35:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192119866] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:35:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013831744] [2023-03-30 22:35:30,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-30 22:35:30,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:35:30,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:35:30,974 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-03-30 22:35:30,976 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-03-30 22:35:31,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-30 22:35:31,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:35:31,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 63 conjunts are in the unsatisfiable core [2023-03-30 22:35:31,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:35:31,051 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-03-30 22:35:31,054 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-03-30 22:35:31,080 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-03-30 22:35:31,089 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-03-30 22:35:31,099 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-03-30 22:35:31,107 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-03-30 22:35:31,183 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 26 treesize of output 21 [2023-03-30 22:35:31,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:31,294 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 35 treesize of output 33 [2023-03-30 22:35:31,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:31,428 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 44 treesize of output 45 [2023-03-30 22:35:31,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:35:31,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 57 [2023-03-30 22:35:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-30 22:35:31,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:35:35,730 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse5 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 12 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 8 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4)))))))) is different from false [2023-03-30 22:35:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2023-03-30 22:35:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013831744] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:35:36,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:35:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 60 [2023-03-30 22:35:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853059748] [2023-03-30 22:35:36,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:35:36,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-03-30 22:35:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:35:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-03-30 22:35:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3194, Unknown=1, NotChecked=114, Total=3540 [2023-03-30 22:35:36,566 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 60 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:35:41,134 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (= c_main_~i~0 0) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse5 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 12 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 8 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0)) is different from false [2023-03-30 22:35:44,795 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse7 (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0))) (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (= c_main_~i~0 0) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse5 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 12 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 8 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) .cse6 .cse7 (or (and .cse6 .cse7) (< 0 (div c_~N~0 1073741824))))) is different from false [2023-03-30 22:35:48,401 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_~N~0 1073741824))) (let ((.cse7 (* 1073741824 .cse8)) (.cse6 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse9 (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0))) (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse5 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 12 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 8 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) .cse6 (or (<= (+ c_main_~i~0 .cse7) (+ c_~N~0 1)) (<= .cse8 0)) .cse9 (or (< 0 .cse8) (and (<= c_~N~0 (+ c_main_~i~0 1073741822 .cse7)) .cse6 .cse9 (or (<= (+ .cse8 1) 0) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0)))))))) is different from false [2023-03-30 22:35:52,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_~N~0 1073741824))) (let ((.cse3 (* 1073741824 .cse4)) (.cse8 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse9 (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0))) (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (or (<= (+ c_main_~i~0 .cse3) (+ c_~N~0 2)) (<= .cse4 0)) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 4 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse7 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 12 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 8 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (or (and (or (and (<= 2 c_main_~i~0) (<= c_main_~i~0 2)) (<= (+ .cse4 1) 0)) .cse8 (<= c_~N~0 (+ c_main_~i~0 .cse3 1073741821)) .cse9) (< 0 .cse4)) .cse8 .cse9))) is different from false [2023-03-30 22:35:55,859 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_~N~0 1073741824))) (let ((.cse8 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse3 (* 1073741824 .cse4)) (.cse9 (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0))) (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (or (<= (+ c_main_~i~0 .cse3) (+ c_~N~0 3)) (<= .cse4 0)) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 4 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse7 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 12 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 8 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) .cse8 .cse9 (or (and .cse8 (<= c_~N~0 (+ c_main_~i~0 1073741820 .cse3)) (or (and (<= c_main_~i~0 3) (<= 3 c_main_~i~0)) (<= (+ .cse4 1) 0)) .cse9) (< 0 .cse4))))) is different from false [2023-03-30 22:35:59,645 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse5 (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0)) (.cse3 (div c_~N~0 1073741824))) (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (or (< 0 .cse3) (and (<= c_main_~i~0 3) .cse4 .cse5 (<= 4 c_~N~0))) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 4 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse8 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 12 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 8 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) .cse4 .cse5 (<= (+ c_main_~i~0 (* 1073741824 .cse3)) (+ c_~N~0 3)))) is different from false [2023-03-30 22:36:03,525 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (div c_~N~0 1073741824)) (.cse7 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse8 (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0))) (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (<= (+ c_main_~i~0 (* 1073741824 .cse3)) (+ c_~N~0 4)) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse6 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 12 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 8 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) .cse7 .cse8 (or (< 0 .cse3) (and .cse7 (<= c_main_~i~0 4) .cse8 (<= 4 c_~N~0))))) is different from false [2023-03-30 22:36:07,478 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (< .cse2 1) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 8 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (forall ((v_ArrVal_490 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_490))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 4)) 4)) (< 0 (+ .cse5 1)) (not (= (select v_ArrVal_490 main_~a~0.offset) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 12 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 12)) 4)) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 8 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset 8)) 4))))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0)) is different from false