/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 11:39:03,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 11:39:03,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 11:39:03,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 11:39:03,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 11:39:03,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 11:39:03,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 11:39:03,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 11:39:03,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 11:39:03,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 11:39:03,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 11:39:03,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 11:39:03,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 11:39:03,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 11:39:03,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 11:39:03,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 11:39:03,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 11:39:03,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 11:39:03,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 11:39:03,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 11:39:03,163 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 11:39:03,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 11:39:03,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 11:39:03,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 11:39:03,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 11:39:03,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 11:39:03,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 11:39:03,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 11:39:03,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 11:39:03,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 11:39:03,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 11:39:03,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 11:39:03,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 11:39:03,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 11:39:03,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 11:39:03,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 11:39:03,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 11:39:03,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 11:39:03,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 11:39:03,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 11:39:03,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 11:39:03,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 11:39:03,189 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 [2022-03-18 11:39:03,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 11:39:03,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 11:39:03,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-18 11:39:03,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-18 11:39:03,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 11:39:03,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 11:39:03,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 11:39:03,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 11:39:03,225 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 11:39:03,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 11:39:03,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 11:39:03,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 11:39:03,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 11:39:03,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 11:39:03,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 11:39:03,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 11:39:03,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 11:39:03,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 11:39:03,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 11:39:03,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 11:39:03,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 11:39:03,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 11:39:03,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 11:39:03,230 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-18 11:39:03,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-18 11:39:03,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 11:39:03,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 11:39:03,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 11:39:03,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 11:39:03,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 11:39:03,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 11:39:03,431 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 11:39:03,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2022-03-18 11:39:03,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47853298b/50e5d93f2d1d4026825b7741308cf1fc/FLAG3148b6e8e [2022-03-18 11:39:03,882 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 11:39:03,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2022-03-18 11:39:03,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47853298b/50e5d93f2d1d4026825b7741308cf1fc/FLAG3148b6e8e [2022-03-18 11:39:03,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47853298b/50e5d93f2d1d4026825b7741308cf1fc [2022-03-18 11:39:03,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 11:39:03,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 11:39:03,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 11:39:03,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 11:39:03,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 11:39:03,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:39:03" (1/1) ... [2022-03-18 11:39:03,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b51f3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:03, skipping insertion in model container [2022-03-18 11:39:03,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:39:03" (1/1) ... [2022-03-18 11:39:03,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 11:39:03,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 11:39:04,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-03-18 11:39:04,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 11:39:04,108 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 11:39:04,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-03-18 11:39:04,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 11:39:04,134 INFO L208 MainTranslator]: Completed translation [2022-03-18 11:39:04,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04 WrapperNode [2022-03-18 11:39:04,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 11:39:04,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 11:39:04,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 11:39:04,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 11:39:04,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 11:39:04,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 11:39:04,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 11:39:04,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 11:39:04,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (1/1) ... [2022-03-18 11:39:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 11:39:04,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:04,192 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) [2022-03-18 11:39:04,214 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 [2022-03-18 11:39:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 11:39:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 11:39:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 11:39:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 11:39:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2022-03-18 11:39:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 11:39:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 11:39:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 11:39:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 11:39:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-18 11:39:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 11:39:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 11:39:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 11:39:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 11:39:04,291 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 11:39:04,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 11:39:04,427 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 11:39:04,432 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 11:39:04,432 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-18 11:39:04,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:39:04 BoogieIcfgContainer [2022-03-18 11:39:04,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 11:39:04,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 11:39:04,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 11:39:04,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 11:39:04,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 11:39:03" (1/3) ... [2022-03-18 11:39:04,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1053b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:39:04, skipping insertion in model container [2022-03-18 11:39:04,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:39:04" (2/3) ... [2022-03-18 11:39:04,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1053b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:39:04, skipping insertion in model container [2022-03-18 11:39:04,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:39:04" (3/3) ... [2022-03-18 11:39:04,440 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2022-03-18 11:39:04,444 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 11:39:04,444 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 11:39:04,524 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 11:39:04,530 INFO L340 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 [2022-03-18 11:39:04,530 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 11:39:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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) [2022-03-18 11:39:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 11:39:04,561 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:04,562 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:04,563 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1995632546, now seen corresponding path program 1 times [2022-03-18 11:39:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:04,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77088431] [2022-03-18 11:39:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-18 11:39:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:39:04,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:04,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77088431] [2022-03-18 11:39:04,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77088431] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:39:04,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:39:04,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 11:39:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214123274] [2022-03-18 11:39:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:39:04,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 11:39:04,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 11:39:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 11:39:04,875 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 11:39:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:05,057 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-03-18 11:39:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 11:39:05,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 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 18 [2022-03-18 11:39:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:05,073 INFO L225 Difference]: With dead ends: 77 [2022-03-18 11:39:05,073 INFO L226 Difference]: Without dead ends: 43 [2022-03-18 11:39:05,076 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 11:39:05,080 INFO L912 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:05,081 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:39:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-18 11:39:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-03-18 11:39:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-03-18 11:39:05,121 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-03-18 11:39:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:05,121 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-03-18 11:39:05,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 11:39:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-03-18 11:39:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 11:39:05,124 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:05,124 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:05,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 11:39:05,125 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1221136232, now seen corresponding path program 1 times [2022-03-18 11:39:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:05,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750553688] [2022-03-18 11:39:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-18 11:39:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:39:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750553688] [2022-03-18 11:39:05,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750553688] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:39:05,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:39:05,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 11:39:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442589709] [2022-03-18 11:39:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:39:05,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 11:39:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:05,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 11:39:05,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 11:39:05,236 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 11:39:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:05,385 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-03-18 11:39:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 11:39:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 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 18 [2022-03-18 11:39:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:05,388 INFO L225 Difference]: With dead ends: 59 [2022-03-18 11:39:05,388 INFO L226 Difference]: Without dead ends: 38 [2022-03-18 11:39:05,393 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-18 11:39:05,395 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:05,396 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 25 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:39:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-18 11:39:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-03-18 11:39:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-03-18 11:39:05,415 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-03-18 11:39:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:05,416 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-03-18 11:39:05,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 11:39:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-03-18 11:39:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 11:39:05,417 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:05,417 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:05,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 11:39:05,418 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -957735862, now seen corresponding path program 1 times [2022-03-18 11:39:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:05,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911900487] [2022-03-18 11:39:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-18 11:39:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:39:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911900487] [2022-03-18 11:39:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911900487] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287126545] [2022-03-18 11:39:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:05,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:05,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:05,527 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) [2022-03-18 11:39:05,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-18 11:39:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:05,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-18 11:39:05,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:39:05,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:39:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287126545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:05,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-03-18 11:39:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171050686] [2022-03-18 11:39:05,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:05,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 11:39:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:05,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 11:39:05,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-18 11:39:05,789 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 11:39:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:06,007 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-03-18 11:39:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 11:39:06,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-03-18 11:39:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:06,008 INFO L225 Difference]: With dead ends: 68 [2022-03-18 11:39:06,008 INFO L226 Difference]: Without dead ends: 47 [2022-03-18 11:39:06,009 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-18 11:39:06,009 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:06,010 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 27 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:39:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-18 11:39:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-03-18 11:39:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-03-18 11:39:06,017 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2022-03-18 11:39:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:06,017 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-03-18 11:39:06,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 11:39:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-03-18 11:39:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-18 11:39:06,018 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:06,018 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:06,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:06,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:06,242 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1685086224, now seen corresponding path program 2 times [2022-03-18 11:39:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:06,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770123982] [2022-03-18 11:39:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-18 11:39:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-18 11:39:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:06,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770123982] [2022-03-18 11:39:06,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770123982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:39:06,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:39:06,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 11:39:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124331872] [2022-03-18 11:39:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:39:06,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-18 11:39:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-18 11:39:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-18 11:39:06,317 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 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) [2022-03-18 11:39:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:06,479 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-03-18 11:39:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 11:39:06,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 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) Word has length 26 [2022-03-18 11:39:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:06,481 INFO L225 Difference]: With dead ends: 55 [2022-03-18 11:39:06,481 INFO L226 Difference]: Without dead ends: 42 [2022-03-18 11:39:06,482 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-18 11:39:06,487 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:06,488 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:39:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-18 11:39:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-03-18 11:39:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-03-18 11:39:06,503 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2022-03-18 11:39:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:06,504 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-03-18 11:39:06,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 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) [2022-03-18 11:39:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-03-18 11:39:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-18 11:39:06,505 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:06,505 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:06,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 11:39:06,506 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -476963320, now seen corresponding path program 1 times [2022-03-18 11:39:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:06,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312652060] [2022-03-18 11:39:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-18 11:39:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-18 11:39:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:06,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312652060] [2022-03-18 11:39:06,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312652060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:06,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145588937] [2022-03-18 11:39:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:06,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:06,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:06,613 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) [2022-03-18 11:39:06,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-18 11:39:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:06,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 11:39:06,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 11:39:06,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 11:39:06,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145588937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:06,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:06,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-18 11:39:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338094610] [2022-03-18 11:39:06,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:06,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 11:39:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:06,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 11:39:06,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-18 11:39:06,840 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 11:39:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:07,217 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-03-18 11:39:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-18 11:39:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2022-03-18 11:39:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:07,220 INFO L225 Difference]: With dead ends: 85 [2022-03-18 11:39:07,220 INFO L226 Difference]: Without dead ends: 63 [2022-03-18 11:39:07,220 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2022-03-18 11:39:07,221 INFO L912 BasicCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:07,221 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 34 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 11:39:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-18 11:39:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2022-03-18 11:39:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-03-18 11:39:07,237 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2022-03-18 11:39:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:07,237 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-03-18 11:39:07,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 11:39:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-03-18 11:39:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-18 11:39:07,238 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:07,239 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 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] [2022-03-18 11:39:07,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:07,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:07,451 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1852858010, now seen corresponding path program 1 times [2022-03-18 11:39:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:07,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619751450] [2022-03-18 11:39:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:07,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-18 11:39:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:07,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619751450] [2022-03-18 11:39:07,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619751450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:07,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838128240] [2022-03-18 11:39:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:07,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:07,556 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) [2022-03-18 11:39:07,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-18 11:39:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:07,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-18 11:39:07,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-18 11:39:07,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-18 11:39:07,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838128240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:07,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:07,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2022-03-18 11:39:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291660529] [2022-03-18 11:39:07,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:07,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-18 11:39:07,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:07,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-18 11:39:07,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-18 11:39:07,888 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 11:39:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:08,495 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2022-03-18 11:39:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-18 11:39:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-03-18 11:39:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:08,496 INFO L225 Difference]: With dead ends: 96 [2022-03-18 11:39:08,496 INFO L226 Difference]: Without dead ends: 77 [2022-03-18 11:39:08,497 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-18 11:39:08,498 INFO L912 BasicCegarLoop]: 21 mSDtfsCounter, 234 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:08,498 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 27 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 11:39:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-18 11:39:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-03-18 11:39:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-03-18 11:39:08,509 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-03-18 11:39:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:08,509 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-03-18 11:39:08,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 11:39:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-03-18 11:39:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-18 11:39:08,511 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:08,511 INFO L500 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:08,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:08,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:08,726 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1873855898, now seen corresponding path program 2 times [2022-03-18 11:39:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:08,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382291591] [2022-03-18 11:39:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:08,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-18 11:39:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382291591] [2022-03-18 11:39:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382291591] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698266671] [2022-03-18 11:39:08,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 11:39:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:08,889 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) [2022-03-18 11:39:08,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-18 11:39:08,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 11:39:08,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:39:08,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 11:39:08,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-18 11:39:09,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-18 11:39:09,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698266671] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:09,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:09,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2022-03-18 11:39:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857163397] [2022-03-18 11:39:09,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:09,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-18 11:39:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:09,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-18 11:39:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-18 11:39:09,579 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 11:39:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:09,834 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-03-18 11:39:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 11:39:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 67 [2022-03-18 11:39:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:09,836 INFO L225 Difference]: With dead ends: 97 [2022-03-18 11:39:09,836 INFO L226 Difference]: Without dead ends: 84 [2022-03-18 11:39:09,836 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2022-03-18 11:39:09,837 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 197 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:09,837 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 25 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:39:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-18 11:39:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-03-18 11:39:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-03-18 11:39:09,847 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 67 [2022-03-18 11:39:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:09,848 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-03-18 11:39:09,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 11:39:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-03-18 11:39:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-18 11:39:09,849 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:09,849 INFO L500 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:09,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:10,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:10,075 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash -938103862, now seen corresponding path program 3 times [2022-03-18 11:39:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:10,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177525473] [2022-03-18 11:39:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-03-18 11:39:10,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177525473] [2022-03-18 11:39:10,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177525473] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994820652] [2022-03-18 11:39:10,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 11:39:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:10,216 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) [2022-03-18 11:39:10,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-18 11:39:10,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 11:39:10,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:39:10,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-18 11:39:10,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-03-18 11:39:10,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 11:39:10,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994820652] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:39:10,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-18 11:39:10,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2022-03-18 11:39:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894253864] [2022-03-18 11:39:10,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:39:10,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 11:39:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 11:39:10,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-03-18 11:39:10,419 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-18 11:39:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:10,460 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-03-18 11:39:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 11:39:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 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 75 [2022-03-18 11:39:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:10,461 INFO L225 Difference]: With dead ends: 117 [2022-03-18 11:39:10,461 INFO L226 Difference]: Without dead ends: 95 [2022-03-18 11:39:10,462 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-18 11:39:10,462 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:10,463 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 11:39:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-18 11:39:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-03-18 11:39:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-03-18 11:39:10,473 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 75 [2022-03-18 11:39:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:10,474 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-03-18 11:39:10,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-18 11:39:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-03-18 11:39:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-18 11:39:10,475 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:10,475 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:10,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:10,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:10,691 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash 338841578, now seen corresponding path program 4 times [2022-03-18 11:39:10,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:10,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190737031] [2022-03-18 11:39:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-03-18 11:39:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190737031] [2022-03-18 11:39:11,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190737031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623063636] [2022-03-18 11:39:11,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 11:39:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:11,204 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) [2022-03-18 11:39:11,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-18 11:39:11,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 11:39:11,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:39:11,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-18 11:39:11,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:11,823 INFO L356 Elim1Store]: treesize reduction 274, result has 11.6 percent of original size [2022-03-18 11:39:11,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 57 [2022-03-18 11:39:12,023 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-18 11:39:12,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2022-03-18 11:39:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-18 11:39:12,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:12,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2022-03-18 11:39:12,996 INFO L356 Elim1Store]: treesize reduction 117, result has 54.3 percent of original size [2022-03-18 11:39:12,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 564 treesize of output 615 [2022-03-18 11:39:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 165 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-18 11:39:13,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623063636] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:13,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:13,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 16] total 48 [2022-03-18 11:39:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736815223] [2022-03-18 11:39:13,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:13,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-18 11:39:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-18 11:39:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2022-03-18 11:39:13,655 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 46 states have internal predecessors, (112), 4 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-18 11:39:22,022 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#array~0.base| |c_old(~#array~0.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_old(~#array~0.offset)| |c_~#array~0.offset|) (forall ((v_ArrVal_275 Int) (v_ArrVal_274 Int)) (let ((.cse3 (* c_SelectionSort_~lh~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|)) (.cse1 (+ .cse3 |c_~#array~0.offset|))) (or (< v_ArrVal_274 (select .cse0 .cse1)) (let ((.cse2 (store (store .cse0 .cse1 v_ArrVal_275) (+ |c_~#array~0.offset| (* c_SelectionSort_~i~0 4) 4) v_ArrVal_274))) (<= (select .cse2 (+ .cse3 |c_~#array~0.offset| 8)) (select .cse2 (+ .cse3 |c_~#array~0.offset| 12)))))))) (let ((.cse4 (* 4 c_SelectionSort_~rh~0)) (.cse5 (* c_SelectionSort_~i~0 4))) (or (= .cse4 (+ .cse5 4)) (let ((.cse6 (* c_SelectionSort_~lh~0 4))) (and (= .cse5 (+ .cse6 4)) (= .cse4 .cse6))) (= .cse4 .cse5))) (= |c_old(~n~0)| c_~n~0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 11:39:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:25,689 INFO L93 Difference]: Finished difference Result 311 states and 403 transitions. [2022-03-18 11:39:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-18 11:39:25,690 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 46 states have internal predecessors, (112), 4 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-03-18 11:39:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:25,691 INFO L225 Difference]: With dead ends: 311 [2022-03-18 11:39:25,691 INFO L226 Difference]: Without dead ends: 247 [2022-03-18 11:39:25,696 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3388 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=835, Invalid=10086, Unknown=3, NotChecked=206, Total=11130 [2022-03-18 11:39:25,696 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 172 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:25,696 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 77 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1463 Invalid, 0 Unknown, 674 Unchecked, 0.8s Time] [2022-03-18 11:39:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-03-18 11:39:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 180. [2022-03-18 11:39:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 172 states have (on average 1.319767441860465) internal successors, (227), 172 states have internal predecessors, (227), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:39:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 234 transitions. [2022-03-18 11:39:25,721 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 234 transitions. Word has length 78 [2022-03-18 11:39:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:25,721 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 234 transitions. [2022-03-18 11:39:25,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 46 states have internal predecessors, (112), 4 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-18 11:39:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 234 transitions. [2022-03-18 11:39:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-18 11:39:25,722 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:25,722 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:25,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:25,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:25,945 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1355409194, now seen corresponding path program 1 times [2022-03-18 11:39:25,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:25,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299108058] [2022-03-18 11:39:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:25,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 121 proven. 61 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-03-18 11:39:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299108058] [2022-03-18 11:39:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299108058] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133134771] [2022-03-18 11:39:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:26,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:26,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:26,940 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) [2022-03-18 11:39:26,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-18 11:39:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:27,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-18 11:39:27,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:27,116 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 11:39:27,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-18 11:39:27,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-18 11:39:27,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-18 11:39:27,946 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-18 11:39:27,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-03-18 11:39:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-03-18 11:39:28,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:28,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_362) |c_main_~#array~1.base|) |c_main_~#array~1.offset|) 0)) is different from false [2022-03-18 11:39:28,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133134771] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:28,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 11:39:28,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 40 [2022-03-18 11:39:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557908996] [2022-03-18 11:39:28,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:28,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-18 11:39:28,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-18 11:39:28,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1685, Unknown=10, NotChecked=82, Total=1892 [2022-03-18 11:39:28,188 INFO L87 Difference]: Start difference. First operand 180 states and 234 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 7 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-18 11:39:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:31,179 INFO L93 Difference]: Finished difference Result 395 states and 533 transitions. [2022-03-18 11:39:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-18 11:39:31,179 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 7 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2022-03-18 11:39:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:31,181 INFO L225 Difference]: With dead ends: 395 [2022-03-18 11:39:31,181 INFO L226 Difference]: Without dead ends: 293 [2022-03-18 11:39:31,183 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=661, Invalid=8776, Unknown=73, NotChecked=192, Total=9702 [2022-03-18 11:39:31,183 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:31,184 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1264 Invalid, 0 Unknown, 105 Unchecked, 0.7s Time] [2022-03-18 11:39:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-03-18 11:39:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2022-03-18 11:39:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 274 states have (on average 1.354014598540146) internal successors, (371), 275 states have internal predecessors, (371), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 11:39:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 380 transitions. [2022-03-18 11:39:31,233 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 380 transitions. Word has length 78 [2022-03-18 11:39:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:31,233 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 380 transitions. [2022-03-18 11:39:31,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 7 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-18 11:39:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 380 transitions. [2022-03-18 11:39:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-03-18 11:39:31,234 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:31,235 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:31,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:31,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:31,439 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1708055650, now seen corresponding path program 1 times [2022-03-18 11:39:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358023490] [2022-03-18 11:39:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:39:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 117 proven. 92 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-03-18 11:39:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:32,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358023490] [2022-03-18 11:39:32,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358023490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:32,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217476349] [2022-03-18 11:39:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:32,282 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) [2022-03-18 11:39:32,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-18 11:39:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:32,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-18 11:39:32,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:32,416 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 11:39:32,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-18 11:39:32,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-18 11:39:32,620 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:39:32,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:39:33,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-18 11:39:33,344 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-03-18 11:39:33,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-18 11:39:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-03-18 11:39:33,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:33,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_447) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 4)) 1)) is different from false [2022-03-18 11:39:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217476349] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:33,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 11:39:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 44 [2022-03-18 11:39:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113322320] [2022-03-18 11:39:33,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:33,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-18 11:39:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-18 11:39:33,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2093, Unknown=11, NotChecked=92, Total=2352 [2022-03-18 11:39:33,623 INFO L87 Difference]: Start difference. First operand 284 states and 380 transitions. Second operand has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 40 states have internal predecessors, (100), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-03-18 11:39:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:36,833 INFO L93 Difference]: Finished difference Result 621 states and 851 transitions. [2022-03-18 11:39:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-18 11:39:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 40 states have internal predecessors, (100), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 86 [2022-03-18 11:39:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:36,836 INFO L225 Difference]: With dead ends: 621 [2022-03-18 11:39:36,836 INFO L226 Difference]: Without dead ends: 476 [2022-03-18 11:39:36,839 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2998 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=930, Invalid=10756, Unknown=90, NotChecked=214, Total=11990 [2022-03-18 11:39:36,839 INFO L912 BasicCegarLoop]: 20 mSDtfsCounter, 155 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:36,839 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 150 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 893 Invalid, 0 Unknown, 182 Unchecked, 0.5s Time] [2022-03-18 11:39:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-03-18 11:39:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 444. [2022-03-18 11:39:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 431 states have (on average 1.3735498839907192) internal successors, (592), 432 states have internal predecessors, (592), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 11:39:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 605 transitions. [2022-03-18 11:39:36,912 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 605 transitions. Word has length 86 [2022-03-18 11:39:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:36,913 INFO L478 AbstractCegarLoop]: Abstraction has 444 states and 605 transitions. [2022-03-18 11:39:36,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 40 states have internal predecessors, (100), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-03-18 11:39:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 605 transitions. [2022-03-18 11:39:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-18 11:39:36,916 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:36,916 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:36,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-18 11:39:37,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-18 11:39:37,144 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1561022526, now seen corresponding path program 2 times [2022-03-18 11:39:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684052165] [2022-03-18 11:39:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-18 11:39:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-03-18 11:39:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-03-18 11:39:37,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:37,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684052165] [2022-03-18 11:39:37,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684052165] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:39:37,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:39:37,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-18 11:39:37,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29713280] [2022-03-18 11:39:37,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:39:37,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 11:39:37,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:37,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 11:39:37,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-18 11:39:37,238 INFO L87 Difference]: Start difference. First operand 444 states and 605 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 11:39:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:37,499 INFO L93 Difference]: Finished difference Result 868 states and 1188 transitions. [2022-03-18 11:39:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 11:39:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2022-03-18 11:39:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:37,502 INFO L225 Difference]: With dead ends: 868 [2022-03-18 11:39:37,502 INFO L226 Difference]: Without dead ends: 451 [2022-03-18 11:39:37,503 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-03-18 11:39:37,504 INFO L912 BasicCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:37,504 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 26 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:39:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-03-18 11:39:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2022-03-18 11:39:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 428 states have (on average 1.3714953271028036) internal successors, (587), 429 states have internal predecessors, (587), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-18 11:39:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 598 transitions. [2022-03-18 11:39:37,582 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 598 transitions. Word has length 88 [2022-03-18 11:39:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:37,582 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 598 transitions. [2022-03-18 11:39:37,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 11:39:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 598 transitions. [2022-03-18 11:39:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-18 11:39:37,583 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:37,584 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:37,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-18 11:39:37,584 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2091129168, now seen corresponding path program 3 times [2022-03-18 11:39:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:37,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139175812] [2022-03-18 11:39:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:39:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-18 11:39:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-03-18 11:39:38,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:38,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139175812] [2022-03-18 11:39:38,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139175812] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:38,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838856737] [2022-03-18 11:39:38,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 11:39:38,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:38,188 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) [2022-03-18 11:39:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-18 11:39:38,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-18 11:39:38,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:39:38,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-18 11:39:38,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:38,417 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 11:39:38,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-18 11:39:38,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-18 11:39:38,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-18 11:39:38,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-18 11:39:38,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-18 11:39:38,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-18 11:39:38,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 11:39:38,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-03-18 11:39:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-03-18 11:39:39,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:39,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_main_~#array~1.base| v_ArrVal_566) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4))))) is different from false [2022-03-18 11:39:39,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_main_~#array~1.base_10| Int) (v_ArrVal_566 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |v_main_~#array~1.base_10| v_ArrVal_566) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4)))) (not (= (select |c_#valid| |v_main_~#array~1.base_10|) 0)))) is different from false [2022-03-18 11:39:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 9 not checked. [2022-03-18 11:39:39,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838856737] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:39,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:39,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 36 [2022-03-18 11:39:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679040571] [2022-03-18 11:39:39,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:39,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-18 11:39:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:39,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-18 11:39:39,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=991, Unknown=2, NotChecked=130, Total=1260 [2022-03-18 11:39:39,477 INFO L87 Difference]: Start difference. First operand 440 states and 598 transitions. Second operand has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 32 states have internal predecessors, (89), 8 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-18 11:39:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:39:41,103 INFO L93 Difference]: Finished difference Result 757 states and 1040 transitions. [2022-03-18 11:39:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-18 11:39:41,104 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 32 states have internal predecessors, (89), 8 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 94 [2022-03-18 11:39:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:39:41,106 INFO L225 Difference]: With dead ends: 757 [2022-03-18 11:39:41,106 INFO L226 Difference]: Without dead ends: 348 [2022-03-18 11:39:41,107 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=490, Invalid=2378, Unknown=2, NotChecked=210, Total=3080 [2022-03-18 11:39:41,108 INFO L912 BasicCegarLoop]: 19 mSDtfsCounter, 153 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 11:39:41,108 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 24 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 579 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2022-03-18 11:39:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-03-18 11:39:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2022-03-18 11:39:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 327 states have (on average 1.385321100917431) internal successors, (453), 328 states have internal predecessors, (453), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-18 11:39:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 464 transitions. [2022-03-18 11:39:41,165 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 464 transitions. Word has length 94 [2022-03-18 11:39:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:39:41,165 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 464 transitions. [2022-03-18 11:39:41,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 32 states have internal predecessors, (89), 8 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-18 11:39:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 464 transitions. [2022-03-18 11:39:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-18 11:39:41,166 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:39:41,166 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:39:41,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-18 11:39:41,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-18 11:39:41,379 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:39:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:39:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 332347090, now seen corresponding path program 4 times [2022-03-18 11:39:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:39:41,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545489057] [2022-03-18 11:39:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:39:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:39:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:39:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:39:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:39:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-18 11:39:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:39:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 46 proven. 183 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-18 11:39:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:39:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545489057] [2022-03-18 11:39:42,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545489057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:39:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215646897] [2022-03-18 11:39:42,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 11:39:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:39:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:39:42,544 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) [2022-03-18 11:39:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-18 11:39:42,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 11:39:42,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:39:42,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-18 11:39:42,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:39:43,097 INFO L356 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2022-03-18 11:39:43,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 42 [2022-03-18 11:39:43,317 INFO L356 Elim1Store]: treesize reduction 228, result has 8.8 percent of original size [2022-03-18 11:39:43,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 50 treesize of output 40 [2022-03-18 11:39:43,438 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-18 11:39:43,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-03-18 11:39:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 55 proven. 168 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-18 11:39:43,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:39:46,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2022-03-18 11:39:46,432 INFO L356 Elim1Store]: treesize reduction 81, result has 52.1 percent of original size [2022-03-18 11:39:46,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1034 treesize of output 991 [2022-03-18 11:39:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 152 proven. 53 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-03-18 11:39:46,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215646897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:39:46,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:39:46,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 21, 16] total 68 [2022-03-18 11:39:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620718789] [2022-03-18 11:39:46,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:39:46,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-18 11:39:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:39:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-18 11:39:46,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=4267, Unknown=1, NotChecked=0, Total=4556 [2022-03-18 11:39:46,919 INFO L87 Difference]: Start difference. First operand 339 states and 464 transitions. Second operand has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 66 states have internal predecessors, (151), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 11:41:32,069 WARN L232 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 99 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:42:10,211 WARN L232 SmtUtils]: Spent 21.92s on a formula simplification. DAG size of input: 85 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:43:07,169 WARN L232 SmtUtils]: Spent 18.20s on a formula simplification. DAG size of input: 84 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:43:30,208 WARN L232 SmtUtils]: Spent 22.85s on a formula simplification. DAG size of input: 85 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:43:51,343 WARN L232 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:44:32,749 WARN L232 SmtUtils]: Spent 18.16s on a formula simplification. DAG size of input: 73 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:44:52,990 WARN L232 SmtUtils]: Spent 20.16s on a formula simplification. DAG size of input: 74 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:45:08,223 WARN L232 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 74 DAG size of output: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:45:35,799 WARN L232 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 87 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:45:54,067 WARN L232 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 92 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 11:47:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:47:05,255 INFO L93 Difference]: Finished difference Result 1797 states and 2490 transitions. [2022-03-18 11:47:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 480 states. [2022-03-18 11:47:05,255 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 66 states have internal predecessors, (151), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 94 [2022-03-18 11:47:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:47:05,261 INFO L225 Difference]: With dead ends: 1797 [2022-03-18 11:47:05,261 INFO L226 Difference]: Without dead ends: 1545 [2022-03-18 11:47:05,281 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 196 SyntacticMatches, 7 SemanticMatches, 536 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124694 ImplicationChecksByTransitivity, 438.5s TimeCoverageRelationStatistics Valid=16854, Invalid=271981, Unknown=71, NotChecked=0, Total=288906 [2022-03-18 11:47:05,281 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 993 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4575 mSolverCounterSat, 1347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1347 IncrementalHoareTripleChecker+Valid, 4575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4220 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:47:05,281 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 127 Invalid, 10142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1347 Valid, 4575 Invalid, 0 Unknown, 4220 Unchecked, 3.0s Time] [2022-03-18 11:47:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-03-18 11:47:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 862. [2022-03-18 11:47:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 850 states have (on average 1.4058823529411764) internal successors, (1195), 851 states have internal predecessors, (1195), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-18 11:47:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1206 transitions. [2022-03-18 11:47:05,468 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1206 transitions. Word has length 94 [2022-03-18 11:47:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:47:05,468 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1206 transitions. [2022-03-18 11:47:05,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 66 states have internal predecessors, (151), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 11:47:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1206 transitions. [2022-03-18 11:47:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-18 11:47:05,471 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:47:05,471 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:47:05,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-18 11:47:05,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-18 11:47:05,680 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:47:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:47:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1911636208, now seen corresponding path program 5 times [2022-03-18 11:47:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:47:05,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331607516] [2022-03-18 11:47:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:47:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:47:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:47:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:47:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:06,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:47:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-18 11:47:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-03-18 11:47:06,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:47:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331607516] [2022-03-18 11:47:06,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331607516] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603240978] [2022-03-18 11:47:06,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 11:47:06,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:47:06,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:47:06,347 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) [2022-03-18 11:47:06,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-18 11:47:06,543 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-03-18 11:47:06,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:47:06,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-18 11:47:06,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:47:06,583 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 11:47:06,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-18 11:47:06,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-18 11:47:06,721 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:06,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:06,765 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:06,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:07,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-18 11:47:07,542 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-03-18 11:47:07,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-18 11:47:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-03-18 11:47:07,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:47:07,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_734) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 8)))) is different from false [2022-03-18 11:47:07,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603240978] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:07,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 11:47:07,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2022-03-18 11:47:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056539964] [2022-03-18 11:47:07,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 11:47:07,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-18 11:47:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:47:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-18 11:47:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1421, Unknown=11, NotChecked=76, Total=1640 [2022-03-18 11:47:07,832 INFO L87 Difference]: Start difference. First operand 862 states and 1206 transitions. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 9 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-18 11:47:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:47:09,432 INFO L93 Difference]: Finished difference Result 1671 states and 2349 transitions. [2022-03-18 11:47:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-18 11:47:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 9 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 94 [2022-03-18 11:47:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:47:09,435 INFO L225 Difference]: With dead ends: 1671 [2022-03-18 11:47:09,436 INFO L226 Difference]: Without dead ends: 840 [2022-03-18 11:47:09,438 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=397, Invalid=3842, Unknown=55, NotChecked=128, Total=4422 [2022-03-18 11:47:09,438 INFO L912 BasicCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 11:47:09,438 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 210 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 861 Invalid, 0 Unknown, 188 Unchecked, 0.4s Time] [2022-03-18 11:47:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-03-18 11:47:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2022-03-18 11:47:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 824 states have (on average 1.4053398058252426) internal successors, (1158), 825 states have internal predecessors, (1158), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 11:47:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1171 transitions. [2022-03-18 11:47:09,603 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1171 transitions. Word has length 94 [2022-03-18 11:47:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:47:09,604 INFO L478 AbstractCegarLoop]: Abstraction has 838 states and 1171 transitions. [2022-03-18 11:47:09,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 9 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-18 11:47:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1171 transitions. [2022-03-18 11:47:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-18 11:47:09,606 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:47:09,606 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:47:09,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-18 11:47:09,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-18 11:47:09,820 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:47:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:47:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1699502714, now seen corresponding path program 6 times [2022-03-18 11:47:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:47:09,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853961563] [2022-03-18 11:47:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:47:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:47:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:47:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:47:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:47:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:10,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-18 11:47:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:10,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-03-18 11:47:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 7 proven. 181 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-03-18 11:47:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:47:10,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853961563] [2022-03-18 11:47:10,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853961563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:10,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843398176] [2022-03-18 11:47:10,777 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-18 11:47:10,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:47:10,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:47:10,778 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) [2022-03-18 11:47:10,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-18 11:47:10,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-03-18 11:47:10,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:47:11,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-18 11:47:11,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:47:11,045 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 11:47:11,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-18 11:47:11,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-18 11:47:11,190 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:11,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:11,237 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-03-18 11:47:11,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-03-18 11:47:11,325 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-03-18 11:47:11,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-03-18 11:47:11,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-03-18 11:47:12,969 INFO L356 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-03-18 11:47:12,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 13 [2022-03-18 11:47:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-03-18 11:47:13,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:47:13,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_823) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 12)))) is different from false [2022-03-18 11:47:13,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843398176] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:13,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 11:47:13,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-03-18 11:47:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560928553] [2022-03-18 11:47:13,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 11:47:13,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-18 11:47:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:47:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-18 11:47:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2367, Unknown=14, NotChecked=98, Total=2652 [2022-03-18 11:47:13,387 INFO L87 Difference]: Start difference. First operand 838 states and 1171 transitions. Second operand has 45 states, 43 states have (on average 2.302325581395349) internal successors, (99), 41 states have internal predecessors, (99), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-18 11:47:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:47:15,842 INFO L93 Difference]: Finished difference Result 1633 states and 2290 transitions. [2022-03-18 11:47:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-18 11:47:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.302325581395349) internal successors, (99), 41 states have internal predecessors, (99), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 102 [2022-03-18 11:47:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:47:15,845 INFO L225 Difference]: With dead ends: 1633 [2022-03-18 11:47:15,845 INFO L226 Difference]: Without dead ends: 871 [2022-03-18 11:47:15,847 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 110 SyntacticMatches, 13 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=515, Invalid=7100, Unknown=45, NotChecked=172, Total=7832 [2022-03-18 11:47:15,847 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 11:47:15,847 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 284 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 699 Invalid, 0 Unknown, 355 Unchecked, 0.4s Time] [2022-03-18 11:47:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-18 11:47:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 862. [2022-03-18 11:47:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 846 states have (on average 1.3995271867612293) internal successors, (1184), 847 states have internal predecessors, (1184), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-18 11:47:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1199 transitions. [2022-03-18 11:47:16,007 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1199 transitions. Word has length 102 [2022-03-18 11:47:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:47:16,007 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1199 transitions. [2022-03-18 11:47:16,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.302325581395349) internal successors, (99), 41 states have internal predecessors, (99), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-18 11:47:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1199 transitions. [2022-03-18 11:47:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-18 11:47:16,010 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:47:16,010 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:47:16,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-18 11:47:16,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-18 11:47:16,223 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:47:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:47:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1203177028, now seen corresponding path program 7 times [2022-03-18 11:47:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:47:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95259872] [2022-03-18 11:47:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:47:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:47:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:47:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:47:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:47:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-18 11:47:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-03-18 11:47:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-18 11:47:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 123 proven. 92 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-03-18 11:47:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:47:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95259872] [2022-03-18 11:47:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95259872] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735465281] [2022-03-18 11:47:17,106 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-18 11:47:17,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:47:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:47:17,108 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) [2022-03-18 11:47:17,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-18 11:47:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:17,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-18 11:47:17,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:47:17,303 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 11:47:17,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-18 11:47:17,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-18 11:47:17,423 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:17,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:17,476 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:17,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:17,526 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:17,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:17,579 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-18 11:47:17,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-18 11:47:18,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-18 11:47:18,771 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-03-18 11:47:18,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-18 11:47:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 9 proven. 163 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-03-18 11:47:18,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:47:19,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_914) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 16)) 4)) is different from false [2022-03-18 11:47:19,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735465281] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:19,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 11:47:19,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 46 [2022-03-18 11:47:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968294521] [2022-03-18 11:47:19,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 11:47:19,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-18 11:47:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:47:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-18 11:47:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2559, Unknown=11, NotChecked=102, Total=2862 [2022-03-18 11:47:19,206 INFO L87 Difference]: Start difference. First operand 862 states and 1199 transitions. Second operand has 46 states, 45 states have (on average 2.4) internal successors, (108), 42 states have internal predecessors, (108), 11 states have call successors, (13), 9 states have call predecessors, (13), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-18 11:47:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:47:22,256 INFO L93 Difference]: Finished difference Result 1860 states and 2619 transitions. [2022-03-18 11:47:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-18 11:47:22,256 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.4) internal successors, (108), 42 states have internal predecessors, (108), 11 states have call successors, (13), 9 states have call predecessors, (13), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 110 [2022-03-18 11:47:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:47:22,260 INFO L225 Difference]: With dead ends: 1860 [2022-03-18 11:47:22,260 INFO L226 Difference]: Without dead ends: 1179 [2022-03-18 11:47:22,263 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 141 SyntacticMatches, 14 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2941 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=792, Invalid=10250, Unknown=92, NotChecked=208, Total=11342 [2022-03-18 11:47:22,263 INFO L912 BasicCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-18 11:47:22,263 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 243 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1060 Invalid, 0 Unknown, 187 Unchecked, 0.6s Time] [2022-03-18 11:47:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-03-18 11:47:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1025. [2022-03-18 11:47:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4081429990069514) internal successors, (1418), 1008 states have internal predecessors, (1418), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-18 11:47:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1435 transitions. [2022-03-18 11:47:22,541 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1435 transitions. Word has length 110 [2022-03-18 11:47:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:47:22,541 INFO L478 AbstractCegarLoop]: Abstraction has 1025 states and 1435 transitions. [2022-03-18 11:47:22,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.4) internal successors, (108), 42 states have internal predecessors, (108), 11 states have call successors, (13), 9 states have call predecessors, (13), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-18 11:47:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1435 transitions. [2022-03-18 11:47:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-18 11:47:22,545 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:47:22,545 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:47:22,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-18 11:47:22,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-18 11:47:22,760 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:47:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:47:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -611444882, now seen corresponding path program 8 times [2022-03-18 11:47:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:47:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552326331] [2022-03-18 11:47:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:47:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:47:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:47:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 11:47:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 11:47:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-03-18 11:47:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-03-18 11:47:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-18 11:47:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-18 11:47:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:47:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-03-18 11:47:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:47:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552326331] [2022-03-18 11:47:22,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552326331] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:47:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099229695] [2022-03-18 11:47:22,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 11:47:22,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:47:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:47:22,876 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:47:22,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-18 11:47:23,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 11:47:23,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:47:23,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 11:47:23,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:47:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-03-18 11:47:23,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 11:47:23,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099229695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:47:23,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-18 11:47:23,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2022-03-18 11:47:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866338225] [2022-03-18 11:47:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:47:23,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 11:47:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:47:23,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 11:47:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-18 11:47:23,176 INFO L87 Difference]: Start difference. First operand 1025 states and 1435 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-18 11:47:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:47:23,378 INFO L93 Difference]: Finished difference Result 1028 states and 1438 transitions. [2022-03-18 11:47:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 11:47:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 118 [2022-03-18 11:47:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:47:23,378 INFO L225 Difference]: With dead ends: 1028 [2022-03-18 11:47:23,378 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 11:47:23,380 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-18 11:47:23,381 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:47:23,381 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 124 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 11:47:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 11:47:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 11:47:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-18 11:47:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 11:47:23,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-03-18 11:47:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:47:23,382 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 11:47:23,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-03-18 11:47:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 11:47:23,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 11:47:23,384 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 11:47:23,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-18 11:47:23,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:47:23,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 11:47:29,019 WARN L232 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 476 DAG size of output: 437 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-18 11:50:06,410 WARN L232 SmtUtils]: Spent 2.62m on a formula simplification. DAG size of input: 1152 DAG size of output: 1095 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-18 11:50:32,720 WARN L232 SmtUtils]: Spent 23.65s on a formula simplification. DAG size of input: 1083 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-18 11:50:33,309 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-03-18 11:50:33,309 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-03-18 11:50:33,309 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-03-18 11:50:33,309 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 40 52) no Hoare annotation was computed. [2022-03-18 11:50:33,310 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse9 (= (select .cse10 (+ 4 |main_~#array~1.offset|)) 1)) (.cse1 (= (select .cse10 |main_~#array~1.offset|) 0)) (.cse2 (<= 0 main_~i~1)) (.cse3 (= (select .cse10 (+ 16 |main_~#array~1.offset|)) 4)) (.cse4 (<= 5 ~n~0)) (.cse8 (= (select .cse10 (+ 12 |main_~#array~1.offset|)) 3)) (.cse5 (not (= |main_~#array~1.base| 3))) (.cse6 (= 2 (select .cse10 (+ 8 |main_~#array~1.offset|)))) (.cse7 (<= main_~i~1 4)) (.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (and .cse1 .cse2 (= main_~i~1 3) .cse3 .cse4 .cse5 .cse6 (= 3 |main_#t~mem9|) .cse7) (and .cse1 (= |main_#t~mem9| 0) .cse3 .cse8 .cse5 .cse6 .cse9 (= main_~i~1 0)) (not (= (select .cse0 |~#array~0.offset|) 0)) (and .cse1 (= |main_#t~mem9| 1) .cse3 .cse8 .cse5 (= main_~i~1 1) .cse6 .cse9) (not (= (select |old(#valid)| 3) 1)) (and .cse1 .cse2 .cse3 (= |main_#t~mem9| 4) (= main_~i~1 4) .cse4 .cse5 .cse6 .cse7) (not .cse4) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 (= main_~i~1 2) .cse6 (= 2 |main_#t~mem9|) .cse7) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|))))) [2022-03-18 11:50:33,310 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-03-18 11:50:33,310 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 40 52) no Hoare annotation was computed. [2022-03-18 11:50:33,310 INFO L882 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-03-18 11:50:33,310 INFO L878 garLoopResultBuilder]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse3 (+ 16 |~#array~0.offset|)) (.cse2 (+ |~#array~0.offset| 8)) (.cse1 (+ |~#array~0.offset| 12)) (.cse19 (select |#memory_int| |~#array~0.base|)) (.cse17 (+ |~#array~0.offset| 4)) (.cse16 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse15 (= (select .cse16 (+ 12 |main_~#array~1.offset|)) 3)) (.cse4 (= 0 (select .cse19 .cse17))) (.cse5 (= (select .cse19 .cse1) 0)) (.cse6 (= (select .cse16 (+ 16 |main_~#array~1.offset|)) 4)) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= (select .cse19 |~#array~0.offset|) 0)) (.cse9 (= (select .cse19 .cse2) 0)) (.cse10 (not (= |main_~#array~1.base| 3))) (.cse11 (= (select .cse19 .cse3) 0)) (.cse12 (= 2 (select .cse16 (+ 8 |main_~#array~1.offset|)))) (.cse13 (= (select .cse16 (+ 4 |main_~#array~1.offset|)) 1)) (.cse14 (exists ((v_main_~i~1_79 Int)) (let ((.cse18 (select |#memory_int| |main_~#array~1.base|))) (and (<= v_main_~i~1_79 (+ main_~i~1 1)) (or (<= 2 v_main_~i~1_79) (= (select .cse18 (+ 12 |main_~#array~1.offset|)) 3)) (= v_main_~i~1_79 (select .cse18 (+ (* v_main_~i~1_79 4) |main_~#array~1.offset|))))))) (.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= 0 (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= main_~i~1 0) .cse14) (not (= (select .cse0 |~#array~0.offset|) 0)) (and (= |#memory_int| |old(#memory_int)|) .cse7 (= main_~i~1 4) .cse10) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 (= main_~i~1 2) .cse11) (not (= (select |old(#valid)| 3) 1)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 (= main_~i~1 1) .cse11 .cse12) (not (<= 5 ~n~0)) (and .cse4 .cse5 (= main_~i~1 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse4 (= (select .cse16 |main_~#array~1.offset|) 0) .cse5 .cse6 .cse7 (<= (+ main_~i~1 1) 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= (select .cse0 .cse17) 0)) (not (<= 0 |~#array~0.offset|))))) [2022-03-18 11:50:33,310 INFO L878 garLoopResultBuilder]: At program point L44-4(lines 44 45) the Hoare annotation is: (let ((.cse1 (+ |~#array~0.offset| 12)) (.cse2 (+ |~#array~0.offset| 8)) (.cse3 (+ 16 |~#array~0.offset|)) (.cse0 (select |old(#memory_int)| |~#array~0.base|)) (.cse5 (+ |~#array~0.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= 0 (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 0)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (= (select |old(#valid)| 3) 1)) (let ((.cse4 (select |#memory_int| |~#array~0.base|)) (.cse6 (select |#memory_int| |main_~#array~1.base|))) (and (= 0 (select .cse4 .cse5)) (= (select .cse6 |main_~#array~1.offset|) 0) (= (select .cse4 .cse1) 0) (= (select .cse6 (+ 16 |main_~#array~1.offset|)) 4) (= (select |#valid| 3) 1) (<= (+ main_~i~1 1) 0) (= (select .cse4 |~#array~0.offset|) 0) (= (select .cse6 (+ 12 |main_~#array~1.offset|)) 3) (= (select .cse4 .cse2) 0) (not (= |main_~#array~1.base| 3)) (= (select .cse4 .cse3) 0) (= 2 (select .cse6 (+ 8 |main_~#array~1.offset|))) (= (select .cse6 (+ 4 |main_~#array~1.offset|)) 1))) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 .cse5) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-18 11:50:33,310 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 40 52) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (and (= |#memory_int| |old(#memory_int)|) (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-18 11:50:33,310 INFO L882 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-03-18 11:50:33,310 INFO L882 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L878 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse1 (<= 0 main_~i~1)) (.cse6 (select |old(#memory_int)| |~#array~0.base|)) (.cse0 (= (select .cse8 |main_~#array~1.offset|) 0)) (.cse2 (= (select .cse8 (+ 16 |main_~#array~1.offset|)) 4)) (.cse3 (= (select .cse8 (+ 12 |main_~#array~1.offset|)) 3)) (.cse4 (not (= |main_~#array~1.base| 3))) (.cse5 (= 2 (select .cse8 (+ 8 |main_~#array~1.offset|)))) (.cse7 (= (select .cse8 (+ 4 |main_~#array~1.offset|)) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~i~1 2) .cse5) (not (= (select .cse6 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse6 (+ |~#array~0.offset| 8)))) (not (= (select .cse6 (+ 16 |~#array~0.offset|)) 0)) (and .cse0 .cse1 .cse2 (= main_~i~1 4) .cse4 .cse5) (and .cse0 .cse1 (= main_~i~1 3) .cse2 .cse3 .cse4 .cse5) (not (= (select .cse6 |~#array~0.offset|) 0)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 (= main_~i~1 0)) (and .cse0 .cse1 (<= 5 main_~i~1) .cse4 .cse5) (not (= (select .cse6 (+ |~#array~0.offset| 4)) 0)) (and .cse0 .cse2 .cse3 .cse4 (= main_~i~1 1) .cse5 .cse7) (not (<= 0 |~#array~0.offset|))))) [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~n~0 |old(~n~0)|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point SelectionSortEXIT(lines 26 38) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L878 garLoopResultBuilder]: At program point SelectionSortENTRY(lines 26 38) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (= |#memory_int| |old(#memory_int)|) (not (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 33) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|))) (or (and (= |#memory_int| |old(#memory_int)|) (= SelectionSort_~lh~0 0)) (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (not (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and (< SelectionSort_~lh~0 ~n~0) (exists ((v_ArrVal_812 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |~#array~0.base| v_ArrVal_812)))) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (not (<= 0 |~#array~0.offset|)))) [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 37) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#array~0.base|)) (.cse1 (exists ((v_ArrVal_351 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |~#array~0.base| v_ArrVal_351))))) (or (and (= |#memory_int| |old(#memory_int)|) (= SelectionSort_~lh~0 0)) (not (= (select .cse0 (+ |~#array~0.offset| 12)) 0)) (not (= 0 (select .cse0 (+ |~#array~0.offset| 8)))) (not (= (select .cse0 (+ 16 |~#array~0.offset|)) 0)) (not (= (select |#valid| 3) 1)) (not (= (select .cse0 |~#array~0.offset|) 0)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select .cse0 (+ |~#array~0.offset| 4)) 0)) (and (< ~n~0 (+ SelectionSort_~i~0 3)) .cse1) (and (<= ~n~0 (+ SelectionSort_~lh~0 4)) .cse1) (not (<= 0 |~#array~0.offset|)))) [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point L30-4(lines 26 38) no Hoare annotation was computed. [2022-03-18 11:50:33,311 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-18 11:50:33,312 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#array~0.base|))) (and (= 0 (select .cse0 (+ |~#array~0.offset| 4))) (= (select .cse0 (+ |~#array~0.offset| 12)) 0) (= 3 |~#array~0.base|) (= (select |#valid| 3) 1) (<= 5 ~n~0) (= (select .cse0 |~#array~0.offset|) 0) (= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= |~#array~0.offset| 0) (= (select .cse0 (+ 16 |~#array~0.offset|)) 0))) [2022-03-18 11:50:33,312 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 11:50:33,312 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-18 11:50:33,312 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-03-18 11:50:33,312 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-03-18 11:50:33,312 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-03-18 11:50:33,312 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-03-18 11:50:33,312 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-03-18 11:50:33,312 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-03-18 11:50:33,315 INFO L718 BasicCegarLoop]: Path program histogram: [8, 4, 2, 1, 1, 1, 1] [2022-03-18 11:50:33,316 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 11:50:33,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,342 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-03-18 11:50:33,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-03-18 11:50:33,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 11:50:33 BoogieIcfgContainer [2022-03-18 11:50:33,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 11:50:33,364 INFO L158 Benchmark]: Toolchain (without parser) took 689455.20ms. Allocated memory was 182.5MB in the beginning and 543.2MB in the end (delta: 360.7MB). Free memory was 124.0MB in the beginning and 233.3MB in the end (delta: -109.3MB). Peak memory consumption was 355.7MB. Max. memory is 8.0GB. [2022-03-18 11:50:33,364 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 11:50:33,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.73ms. Allocated memory was 182.5MB in the beginning and 261.1MB in the end (delta: 78.6MB). Free memory was 123.8MB in the beginning and 230.0MB in the end (delta: -106.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-03-18 11:50:33,365 INFO L158 Benchmark]: Boogie Preprocessor took 27.60ms. Allocated memory is still 261.1MB. Free memory was 230.0MB in the beginning and 228.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 11:50:33,365 INFO L158 Benchmark]: RCFGBuilder took 270.12ms. Allocated memory is still 261.1MB. Free memory was 228.5MB in the beginning and 216.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-18 11:50:33,365 INFO L158 Benchmark]: TraceAbstraction took 688928.64ms. Allocated memory was 261.1MB in the beginning and 543.2MB in the end (delta: 282.1MB). Free memory was 216.3MB in the beginning and 233.3MB in the end (delta: -16.9MB). Peak memory consumption was 369.6MB. Max. memory is 8.0GB. [2022-03-18 11:50:33,366 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.73ms. Allocated memory was 182.5MB in the beginning and 261.1MB in the end (delta: 78.6MB). Free memory was 123.8MB in the beginning and 230.0MB in the end (delta: -106.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.60ms. Allocated memory is still 261.1MB. Free memory was 230.0MB in the beginning and 228.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.12ms. Allocated memory is still 261.1MB. Free memory was 228.5MB in the beginning and 216.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 688928.64ms. Allocated memory was 261.1MB in the beginning and 543.2MB in the end (delta: 282.1MB). Free memory was 216.3MB in the beginning and 233.3MB in the end (delta: -16.9MB). Peak memory consumption was 369.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 688.8s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 468.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 189.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2761 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2746 mSDsluCounter, 1645 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6004 IncrementalHoareTripleChecker+Unchecked, 1192 mSDsCounter, 2453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12562 IncrementalHoareTripleChecker+Invalid, 21019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2453 mSolverCounterUnsat, 453 mSDtfsCounter, 12562 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2933 GetRequests, 1557 SyntacticMatches, 66 SemanticMatches, 1310 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 140290 ImplicationChecksByTransitivity, 470.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1025occurred in iteration=17, InterpolantAutomatonStates: 946, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 64 PreInvPairs, 717 NumberOfFragments, 1790 HoareAnnotationTreeSize, 64 FomulaSimplifications, 189054 FormulaSimplificationTreeSizeReduction, 163.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 312418 FormulaSimplificationTreeSizeReductionInter, 26.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 2312 NumberOfCodeBlocks, 2246 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2691 ConstructedInterpolants, 287 QuantifiedInterpolants, 27677 SizeOfPredicates, 86 NumberOfNonLiveVariables, 3838 ConjunctsInSsa, 380 ConjunctsInUnsatCore, 39 InterpolantComputations, 6 PerfectInterpolantSequences, 4595/7283 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2022-03-18 11:50:33,377 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,377 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-03-18 11:50:33,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] Derived loop invariant: ((((((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && lh == 0) || !(\old(unknown-#memory_int-unknown)[array][array + 12] == 0)) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || !(\valid[3] == 1)) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || (n < i + 3 && (\exists v_ArrVal_351 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[array := v_ArrVal_351]))) || (n <= lh + 4 && (\exists v_ArrVal_351 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[array := v_ArrVal_351]))) || !(0 <= array) - InvariantResult [Line: 44]: Loop Invariant [2022-03-18 11:50:33,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,379 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,380 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,381 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-03-18 11:50:33,382 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] Derived loop invariant: ((((((((((((((!(\old(unknown-#memory_int-unknown)[array][array + 12] == 0) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || (((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && i == 0) && (\exists v_main_~i~1_79 : int :: (v_main_~i~1_79 <= i + 1 && (2 <= v_main_~i~1_79 || unknown-#memory_int-unknown[array][12 + array] == 3)) && v_main_~i~1_79 == unknown-#memory_int-unknown[array][v_main_~i~1_79 * 4 + array]))) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \valid[3] == 1) && i == 4) && !(array == 3))) || (((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][12 + array] == 3) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && i == 2) && unknown-#memory_int-unknown[array][16 + array] == 0)) || !(\old(\valid)[3] == 1)) || ((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][12 + array] == 3) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && i == 1) && unknown-#memory_int-unknown[array][16 + array] == 0) && 2 == unknown-#memory_int-unknown[array][8 + array])) || !(5 <= n)) || ((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array + 12] == 0) && i == 3) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0)) || !(3 == array)) || !(array <= 0)) || ((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 12] == 0) && unknown-#memory_int-unknown[array][16 + array] == 4) && \valid[3] == 1) && i + 1 <= 0) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && !(array == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && (\exists v_main_~i~1_79 : int :: (v_main_~i~1_79 <= i + 1 && (2 <= v_main_~i~1_79 || unknown-#memory_int-unknown[array][12 + array] == 3)) && v_main_~i~1_79 == unknown-#memory_int-unknown[array][v_main_~i~1_79 * 4 + array]))) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || !(0 <= array) - InvariantResult [Line: 32]: Loop Invariant [2022-03-18 11:50:33,383 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-03-18 11:50:33,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] Derived loop invariant: (((((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && lh == 0) || !(\old(unknown-#memory_int-unknown)[array][array + 12] == 0)) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || !(\valid[3] == 1)) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || (lh < n && (\exists v_ArrVal_812 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[array := v_ArrVal_812]))) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || !(0 <= array) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && i == 2) && 2 == unknown-#memory_int-unknown[array][8 + array]) || !(\old(unknown-#memory_int-unknown)[array][array + 12] == 0)) || !(0 == \old(unknown-#memory_int-unknown)[array][array + 8])) || !(\old(unknown-#memory_int-unknown)[array][16 + array] == 0)) || (((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && unknown-#memory_int-unknown[array][16 + array] == 4) && i == 4) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array])) || ((((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && i == 3) && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array])) || !(\old(unknown-#memory_int-unknown)[array][array] == 0)) || !(\old(\valid)[3] == 1)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || ((((((unknown-#memory_int-unknown[array][array] == 0 && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && i == 0)) || ((((unknown-#memory_int-unknown[array][array] == 0 && 0 <= i) && 5 <= i) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array])) || !(\old(unknown-#memory_int-unknown)[array][array + 4] == 0)) || ((((((unknown-#memory_int-unknown[array][array] == 0 && unknown-#memory_int-unknown[array][16 + array] == 4) && unknown-#memory_int-unknown[array][12 + array] == 3) && !(array == 3)) && i == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1)) || !(0 <= array) RESULT: Ultimate proved your program to be correct! [2022-03-18 11:50:33,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...