/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-7390193 [2022-04-04 18:52:24,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-04 18:52:24,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-04 18:52:24,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-04 18:52:24,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-04 18:52:24,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-04 18:52:24,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-04 18:52:24,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-04 18:52:24,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-04 18:52:24,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-04 18:52:24,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-04 18:52:24,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-04 18:52:24,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-04 18:52:24,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-04 18:52:24,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-04 18:52:24,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-04 18:52:24,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-04 18:52:24,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-04 18:52:24,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-04 18:52:24,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-04 18:52:24,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-04 18:52:24,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-04 18:52:24,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-04 18:52:24,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-04 18:52:24,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-04 18:52:24,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-04 18:52:24,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-04 18:52:24,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-04 18:52:24,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-04 18:52:24,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-04 18:52:24,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-04 18:52:24,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-04 18:52:24,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-04 18:52:24,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-04 18:52:24,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-04 18:52:24,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-04 18:52:24,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-04 18:52:24,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-04 18:52:24,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-04 18:52:24,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-04 18:52:24,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-04 18:52:24,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-04 18:52:24,929 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-04-04 18:52:24,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-04 18:52:24,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-04 18:52:24,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-04 18:52:24,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-04 18:52:24,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-04 18:52:24,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-04 18:52:24,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-04 18:52:24,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-04 18:52:24,953 INFO L138 SettingsManager]: * Use SBE=true [2022-04-04 18:52:24,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-04 18:52:24,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-04 18:52:24,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-04 18:52:24,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-04 18:52:24,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-04 18:52:24,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-04 18:52:24,956 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-04-04 18:52:25,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-04 18:52:25,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-04 18:52:25,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-04 18:52:25,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-04 18:52:25,196 INFO L275 PluginConnector]: CDTParser initialized [2022-04-04 18:52:25,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2022-04-04 18:52:25,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961d8188f/1b13251d9ff942cb8bfab498a8d84fc4/FLAG3583f1753 [2022-04-04 18:52:25,606 INFO L306 CDTParser]: Found 1 translation units. [2022-04-04 18:52:25,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2022-04-04 18:52:25,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961d8188f/1b13251d9ff942cb8bfab498a8d84fc4/FLAG3583f1753 [2022-04-04 18:52:25,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961d8188f/1b13251d9ff942cb8bfab498a8d84fc4 [2022-04-04 18:52:25,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-04 18:52:25,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-04 18:52:25,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-04 18:52:25,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-04 18:52:25,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-04 18:52:25,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2a8110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25, skipping insertion in model container [2022-04-04 18:52:25,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-04 18:52:25,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-04 18:52:25,782 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-04-04 18:52:25,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-04 18:52:25,820 INFO L203 MainTranslator]: Completed pre-run [2022-04-04 18:52:25,832 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-04-04 18:52:25,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-04 18:52:25,859 INFO L208 MainTranslator]: Completed translation [2022-04-04 18:52:25,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25 WrapperNode [2022-04-04 18:52:25,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-04 18:52:25,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-04 18:52:25,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-04 18:52:25,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-04 18:52:25,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-04 18:52:25,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-04 18:52:25,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-04 18:52:25,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-04 18:52:25,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (1/1) ... [2022-04-04 18:52:25,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-04 18:52:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:25,953 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-04-04 18:52:25,975 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-04-04 18:52:25,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-04 18:52:25,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-04 18:52:25,994 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-04 18:52:25,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-04 18:52:25,995 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2022-04-04 18:52:25,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-04 18:52:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-04 18:52:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-04 18:52:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-04 18:52:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-04 18:52:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-04 18:52:26,063 INFO L234 CfgBuilder]: Building ICFG [2022-04-04 18:52:26,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-04 18:52:26,183 INFO L275 CfgBuilder]: Performing block encoding [2022-04-04 18:52:26,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-04 18:52:26,187 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-04 18:52:26,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 06:52:26 BoogieIcfgContainer [2022-04-04 18:52:26,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-04 18:52:26,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-04 18:52:26,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-04 18:52:26,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-04 18:52:26,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 06:52:25" (1/3) ... [2022-04-04 18:52:26,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729d48a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 06:52:26, skipping insertion in model container [2022-04-04 18:52:26,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 06:52:25" (2/3) ... [2022-04-04 18:52:26,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729d48a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 06:52:26, skipping insertion in model container [2022-04-04 18:52:26,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 06:52:26" (3/3) ... [2022-04-04 18:52:26,194 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2022-04-04 18:52:26,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-04 18:52:26,197 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-04 18:52:26,250 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-04 18:52:26,276 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-04-04 18:52:26,276 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-04 18:52:26,287 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-04-04 18:52:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-04 18:52:26,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:26,291 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 18:52:26,291 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1995632546, now seen corresponding path program 1 times [2022-04-04 18:52:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:26,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780898711] [2022-04-04 18:52:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-04 18:52:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 18:52:26,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:26,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780898711] [2022-04-04 18:52:26,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780898711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 18:52:26,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 18:52:26,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-04 18:52:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332608522] [2022-04-04 18:52:26,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 18:52:26,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-04 18:52:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-04 18:52:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-04 18:52:26,483 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-04-04 18:52:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:26,636 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-04-04 18:52:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-04 18:52:26,639 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-04-04 18:52:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:26,648 INFO L225 Difference]: With dead ends: 77 [2022-04-04 18:52:26,648 INFO L226 Difference]: Without dead ends: 43 [2022-04-04 18:52:26,650 INFO L912 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-04-04 18:52:26,655 INFO L913 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-04-04 18:52:26,656 INFO L914 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-04-04 18:52:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-04 18:52:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-04-04 18:52:26,687 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-04-04 18:52:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-04 18:52:26,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-04-04 18:52:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:26,690 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-04 18:52:26,690 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-04-04 18:52:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-04 18:52:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-04 18:52:26,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:26,692 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 18:52:26,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-04 18:52:26,693 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1221136232, now seen corresponding path program 1 times [2022-04-04 18:52:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:26,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083432687] [2022-04-04 18:52:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-04 18:52:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 18:52:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083432687] [2022-04-04 18:52:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083432687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 18:52:26,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 18:52:26,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 18:52:26,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361440038] [2022-04-04 18:52:26,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 18:52:26,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 18:52:26,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:26,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 18:52:26,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 18:52:26,780 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-04-04 18:52:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:26,915 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-04 18:52:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 18:52:26,915 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-04-04 18:52:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:26,916 INFO L225 Difference]: With dead ends: 59 [2022-04-04 18:52:26,916 INFO L226 Difference]: Without dead ends: 38 [2022-04-04 18:52:26,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-04 18:52:26,917 INFO L913 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-04-04 18:52:26,918 INFO L914 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-04-04 18:52:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-04 18:52:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-04-04 18:52:26,927 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-04-04 18:52:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-04 18:52:26,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-04-04 18:52:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:26,928 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-04 18:52:26,928 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-04-04 18:52:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-04 18:52:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-04 18:52:26,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:26,929 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 18:52:26,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-04 18:52:26,929 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:26,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -957735862, now seen corresponding path program 1 times [2022-04-04 18:52:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:26,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215948206] [2022-04-04 18:52:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-04 18:52:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 18:52:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:27,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215948206] [2022-04-04 18:52:27,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215948206] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:52:27,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680016033] [2022-04-04 18:52:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:52:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:27,016 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-04-04 18:52:27,017 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-04-04 18:52:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-04 18:52:27,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:52:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 18:52:27,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:52:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 18:52:27,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680016033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:52:27,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:52:27,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-04-04 18:52:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075577088] [2022-04-04 18:52:27,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:52:27,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-04 18:52:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-04 18:52:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-04 18:52:27,209 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-04-04 18:52:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:27,387 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-04-04 18:52:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-04 18:52:27,387 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-04-04 18:52:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:27,390 INFO L225 Difference]: With dead ends: 68 [2022-04-04 18:52:27,390 INFO L226 Difference]: Without dead ends: 47 [2022-04-04 18:52:27,391 INFO L912 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-04-04 18:52:27,394 INFO L913 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-04-04 18:52:27,396 INFO L914 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-04-04 18:52:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-04 18:52:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-04-04 18:52:27,412 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-04-04 18:52:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-04 18:52:27,413 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2022-04-04 18:52:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:27,413 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-04 18:52:27,414 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-04-04 18:52:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-04 18:52:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-04 18:52:27,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:27,414 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 18:52:27,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-04 18:52:27,615 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-04-04 18:52:27,615 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1685086224, now seen corresponding path program 2 times [2022-04-04 18:52:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:27,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174340249] [2022-04-04 18:52:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-04 18:52:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-04 18:52:27,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:27,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174340249] [2022-04-04 18:52:27,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174340249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 18:52:27,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 18:52:27,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 18:52:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530933741] [2022-04-04 18:52:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 18:52:27,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 18:52:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 18:52:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-04 18:52:27,723 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-04-04 18:52:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:27,857 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-04-04 18:52:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-04 18:52:27,858 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-04-04 18:52:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:27,858 INFO L225 Difference]: With dead ends: 55 [2022-04-04 18:52:27,858 INFO L226 Difference]: Without dead ends: 42 [2022-04-04 18:52:27,859 INFO L912 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-04-04 18:52:27,859 INFO L913 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-04-04 18:52:27,859 INFO L914 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-04-04 18:52:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-04 18:52:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-04-04 18:52:27,863 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-04-04 18:52:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-04 18:52:27,864 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2022-04-04 18:52:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:27,864 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-04 18:52:27,864 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-04-04 18:52:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-04 18:52:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-04 18:52:27,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:27,865 INFO L499 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-04-04 18:52:27,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-04 18:52:27,865 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -476963320, now seen corresponding path program 1 times [2022-04-04 18:52:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:27,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755238922] [2022-04-04 18:52:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-04 18:52:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-04 18:52:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755238922] [2022-04-04 18:52:27,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755238922] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:52:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485309897] [2022-04-04 18:52:27,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:27,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:52:27,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:27,949 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-04-04 18:52:27,950 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-04-04 18:52:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:27,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-04 18:52:27,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:52:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-04 18:52:28,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:52:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-04 18:52:28,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485309897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:52:28,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:52:28,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-04 18:52:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336646321] [2022-04-04 18:52:28,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:52:28,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-04 18:52:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:28,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-04 18:52:28,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-04 18:52:28,139 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-04-04 18:52:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:28,478 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-04 18:52:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-04 18:52:28,479 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-04-04 18:52:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:28,481 INFO L225 Difference]: With dead ends: 85 [2022-04-04 18:52:28,481 INFO L226 Difference]: Without dead ends: 63 [2022-04-04 18:52:28,481 INFO L912 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-04-04 18:52:28,482 INFO L913 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-04-04 18:52:28,482 INFO L914 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-04-04 18:52:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-04 18:52:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2022-04-04 18:52:28,494 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-04-04 18:52:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-04 18:52:28,503 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2022-04-04 18:52:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:28,503 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-04 18:52:28,503 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-04-04 18:52:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-04 18:52:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-04 18:52:28,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:28,504 INFO L499 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-04-04 18:52:28,526 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-04-04 18:52:28,715 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-04-04 18:52:28,716 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:28,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1852858010, now seen corresponding path program 1 times [2022-04-04 18:52:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:28,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159665130] [2022-04-04 18:52:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:28,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:52:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-04 18:52:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159665130] [2022-04-04 18:52:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159665130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:52:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120994115] [2022-04-04 18:52:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:28,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:52:28,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:28,827 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-04-04 18:52:28,828 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-04-04 18:52:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:28,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-04 18:52:28,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:52:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-04 18:52:28,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:52:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-04 18:52:29,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120994115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:52:29,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:52:29,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2022-04-04 18:52:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664700090] [2022-04-04 18:52:29,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:52:29,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-04 18:52:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-04 18:52:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-04 18:52:29,084 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-04-04 18:52:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:29,672 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2022-04-04 18:52:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-04 18:52:29,672 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-04-04 18:52:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:29,673 INFO L225 Difference]: With dead ends: 96 [2022-04-04 18:52:29,673 INFO L226 Difference]: Without dead ends: 77 [2022-04-04 18:52:29,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-04-04 18:52:29,674 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 234 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-04 18:52:29,675 INFO L914 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-04-04 18:52:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-04 18:52:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-04-04 18:52:29,682 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-04-04 18:52:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-04 18:52:29,682 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-04-04 18:52:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:29,683 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-04-04 18:52:29,683 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-04-04 18:52:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-04-04 18:52:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-04 18:52:29,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:29,684 INFO L499 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-04-04 18:52:29,703 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-04-04 18:52:29,899 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-04-04 18:52:29,900 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1873855898, now seen corresponding path program 2 times [2022-04-04 18:52:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:29,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811886486] [2022-04-04 18:52:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:52:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-04 18:52:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:30,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811886486] [2022-04-04 18:52:30,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811886486] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:52:30,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5870856] [2022-04-04 18:52:30,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-04 18:52:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:52:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:30,033 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-04-04 18:52:30,038 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-04-04 18:52:30,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-04 18:52:30,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 18:52:30,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-04 18:52:30,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:52:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-04 18:52:30,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:52:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-04 18:52:30,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5870856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:52:30,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:52:30,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2022-04-04 18:52:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281083698] [2022-04-04 18:52:30,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:52:30,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-04 18:52:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:30,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-04 18:52:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-04-04 18:52:30,567 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-04-04 18:52:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:30,770 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-04-04 18:52:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-04 18:52:30,770 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-04-04 18:52:30,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:30,771 INFO L225 Difference]: With dead ends: 97 [2022-04-04 18:52:30,771 INFO L226 Difference]: Without dead ends: 84 [2022-04-04 18:52:30,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2022-04-04 18:52:30,772 INFO L913 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-04-04 18:52:30,772 INFO L914 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-04-04 18:52:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-04 18:52:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-04 18:52:30,780 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-04-04 18:52:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-04-04 18:52:30,781 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 67 [2022-04-04 18:52:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:30,781 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-04-04 18:52:30,781 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-04-04 18:52:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-04 18:52:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-04 18:52:30,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:30,782 INFO L499 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-04-04 18:52:30,799 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-04-04 18:52:30,999 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-04-04 18:52:30,999 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash -938103862, now seen corresponding path program 3 times [2022-04-04 18:52:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:31,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591907978] [2022-04-04 18:52:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:52:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-04 18:52:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591907978] [2022-04-04 18:52:31,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591907978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:52:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300672109] [2022-04-04 18:52:31,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-04 18:52:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:52:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:31,124 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-04-04 18:52:31,125 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-04-04 18:52:31,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-04 18:52:31,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 18:52:31,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-04 18:52:31,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:52:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-04 18:52:31,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-04 18:52:31,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300672109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 18:52:31,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-04 18:52:31,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2022-04-04 18:52:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010984940] [2022-04-04 18:52:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 18:52:31,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 18:52:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 18:52:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-04 18:52:31,307 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-04-04 18:52:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:52:31,342 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-04 18:52:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-04 18:52:31,343 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-04-04 18:52:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:52:31,343 INFO L225 Difference]: With dead ends: 117 [2022-04-04 18:52:31,343 INFO L226 Difference]: Without dead ends: 95 [2022-04-04 18:52:31,344 INFO L912 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-04-04 18:52:31,344 INFO L913 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-04-04 18:52:31,345 INFO L914 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-04-04 18:52:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-04 18:52:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-04-04 18:52:31,353 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-04-04 18:52:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-04-04 18:52:31,354 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 75 [2022-04-04 18:52:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:52:31,354 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-04-04 18:52:31,354 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-04-04 18:52:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-04 18:52:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-04 18:52:31,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:52:31,355 INFO L499 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-04-04 18:52:31,371 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-04-04 18:52:31,567 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-04-04 18:52:31,568 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:52:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:52:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 338841578, now seen corresponding path program 4 times [2022-04-04 18:52:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:52:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942307291] [2022-04-04 18:52:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:52:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:52:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:52:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:52:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:52:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-04-04 18:52:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:52:32,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942307291] [2022-04-04 18:52:32,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942307291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:52:32,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341145968] [2022-04-04 18:52:32,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-04 18:52:32,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:52:32,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:52:32,021 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-04-04 18:52:32,040 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-04-04 18:52:32,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-04 18:52:32,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 18:52:32,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-04 18:52:32,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:52:32,529 INFO L356 Elim1Store]: treesize reduction 274, result has 11.6 percent of original size [2022-04-04 18:52:32,530 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-04-04 18:52:32,712 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-04 18:52:32,713 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-04-04 18:52:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-04 18:52:32,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:52:35,408 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-04-04 18:52:35,499 INFO L356 Elim1Store]: treesize reduction 117, result has 54.3 percent of original size [2022-04-04 18:52:35,500 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-04-04 18:52:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 165 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-04 18:52:36,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341145968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:52:36,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:52:36,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 16] total 48 [2022-04-04 18:52:36,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213055900] [2022-04-04 18:52:36,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:52:36,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-04 18:52:36,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:52:36,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-04 18:52:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2089, Unknown=1, NotChecked=0, Total=2256 [2022-04-04 18:52:36,078 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-04-04 18:53:47,946 WARN L232 SmtUtils]: Spent 20.36s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-04 18:54:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:54:09,785 INFO L93 Difference]: Finished difference Result 311 states and 403 transitions. [2022-04-04 18:54:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-04 18:54:09,786 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-04-04 18:54:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:54:09,788 INFO L225 Difference]: With dead ends: 311 [2022-04-04 18:54:09,788 INFO L226 Difference]: Without dead ends: 247 [2022-04-04 18:54:09,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3454 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=844, Invalid=10259, Unknown=27, NotChecked=0, Total=11130 [2022-04-04 18:54:09,792 INFO L913 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, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 677 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-04 18:54:09,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 77 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1463 Invalid, 0 Unknown, 677 Unchecked, 0.8s Time] [2022-04-04 18:54:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-04 18:54:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 180. [2022-04-04 18:54:09,818 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-04-04 18:54:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 234 transitions. [2022-04-04 18:54:09,818 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 234 transitions. Word has length 78 [2022-04-04 18:54:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:54:09,819 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 234 transitions. [2022-04-04 18:54:09,819 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-04-04 18:54:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 234 transitions. [2022-04-04 18:54:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-04 18:54:09,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:54:09,820 INFO L499 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-04-04 18:54:09,838 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-04-04 18:54:10,033 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-04-04 18:54:10,034 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:54:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:54:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1355409194, now seen corresponding path program 1 times [2022-04-04 18:54:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:54:10,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050958314] [2022-04-04 18:54:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:54:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:54:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:54:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 121 proven. 61 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-04-04 18:54:10,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:54:10,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050958314] [2022-04-04 18:54:10,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050958314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:54:10,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023649755] [2022-04-04 18:54:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:10,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:54:10,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:54:10,810 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-04-04 18:54:10,839 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-04-04 18:54:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:10,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-04 18:54:10,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:54:10,957 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-04 18:54:10,957 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-04-04 18:54:11,131 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-04-04 18:54:11,607 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-04-04 18:54:11,685 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-04 18:54:11,686 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-04-04 18:54:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-04 18:54:11,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:54:11,909 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-04-04 18:54:11,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023649755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:54:11,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-04 18:54:11,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 40 [2022-04-04 18:54:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817629606] [2022-04-04 18:54:11,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-04 18:54:11,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-04 18:54:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:54:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-04 18:54:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1685, Unknown=10, NotChecked=82, Total=1892 [2022-04-04 18:54:11,912 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-04-04 18:54:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:54:14,799 INFO L93 Difference]: Finished difference Result 395 states and 533 transitions. [2022-04-04 18:54:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-04 18:54:14,800 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-04-04 18:54:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:54:14,801 INFO L225 Difference]: With dead ends: 395 [2022-04-04 18:54:14,801 INFO L226 Difference]: Without dead ends: 293 [2022-04-04 18:54:14,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=661, Invalid=8776, Unknown=73, NotChecked=192, Total=9702 [2022-04-04 18:54:14,804 INFO L913 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.6s IncrementalHoareTripleChecker+Time [2022-04-04 18:54:14,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1264 Invalid, 0 Unknown, 105 Unchecked, 0.6s Time] [2022-04-04 18:54:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-04-04 18:54:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2022-04-04 18:54:14,845 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-04-04 18:54:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 380 transitions. [2022-04-04 18:54:14,846 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 380 transitions. Word has length 78 [2022-04-04 18:54:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:54:14,846 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 380 transitions. [2022-04-04 18:54:14,846 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-04-04 18:54:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 380 transitions. [2022-04-04 18:54:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-04 18:54:14,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:54:14,847 INFO L499 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-04-04 18:54:14,867 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-04-04 18:54:15,057 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-04-04 18:54:15,057 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:54:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:54:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1708055650, now seen corresponding path program 1 times [2022-04-04 18:54:15,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:54:15,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500371914] [2022-04-04 18:54:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:54:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:54:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:54:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 18:54:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 117 proven. 92 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-04 18:54:15,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:54:15,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500371914] [2022-04-04 18:54:15,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500371914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:54:15,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512326858] [2022-04-04 18:54:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:15,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:54:15,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:54:15,750 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-04-04 18:54:15,751 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-04-04 18:54:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:15,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-04 18:54:15,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:54:15,878 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-04 18:54:15,878 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-04-04 18:54:16,007 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-04-04 18:54:16,085 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 18:54:16,085 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-04-04 18:54:16,552 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-04-04 18:54:18,777 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-04 18:54:18,778 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-04-04 18:54:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-04 18:54:18,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:54:19,028 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-04-04 18:54:19,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512326858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:54:19,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-04 18:54:19,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 44 [2022-04-04 18:54:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027015030] [2022-04-04 18:54:19,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-04 18:54:19,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-04 18:54:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:54:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-04 18:54:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2092, Unknown=12, NotChecked=92, Total=2352 [2022-04-04 18:54:19,030 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-04-04 18:54:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:54:22,045 INFO L93 Difference]: Finished difference Result 621 states and 851 transitions. [2022-04-04 18:54:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-04 18:54:22,045 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-04-04 18:54:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:54:22,047 INFO L225 Difference]: With dead ends: 621 [2022-04-04 18:54:22,047 INFO L226 Difference]: Without dead ends: 476 [2022-04-04 18:54:22,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2998 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=930, Invalid=10755, Unknown=91, NotChecked=214, Total=11990 [2022-04-04 18:54:22,050 INFO L913 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.4s IncrementalHoareTripleChecker+Time [2022-04-04 18:54:22,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 150 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 893 Invalid, 0 Unknown, 182 Unchecked, 0.4s Time] [2022-04-04 18:54:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-04-04 18:54:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 444. [2022-04-04 18:54:22,103 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-04-04 18:54:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 605 transitions. [2022-04-04 18:54:22,105 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 605 transitions. Word has length 86 [2022-04-04 18:54:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:54:22,106 INFO L478 AbstractCegarLoop]: Abstraction has 444 states and 605 transitions. [2022-04-04 18:54:22,107 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-04-04 18:54:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 605 transitions. [2022-04-04 18:54:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-04 18:54:22,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:54:22,109 INFO L499 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-04-04 18:54:22,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-04 18:54:22,330 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-04-04 18:54:22,331 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:54:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:54:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1561022526, now seen corresponding path program 2 times [2022-04-04 18:54:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:54:22,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760458265] [2022-04-04 18:54:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:54:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:54:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-04 18:54:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-04 18:54:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-04-04 18:54:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:54:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760458265] [2022-04-04 18:54:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760458265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 18:54:22,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 18:54:22,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-04 18:54:22,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997402300] [2022-04-04 18:54:22,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 18:54:22,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-04 18:54:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:54:22,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-04 18:54:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-04 18:54:22,407 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-04-04 18:54:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:54:22,639 INFO L93 Difference]: Finished difference Result 868 states and 1188 transitions. [2022-04-04 18:54:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-04 18:54:22,639 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-04-04 18:54:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:54:22,641 INFO L225 Difference]: With dead ends: 868 [2022-04-04 18:54:22,641 INFO L226 Difference]: Without dead ends: 451 [2022-04-04 18:54:22,642 INFO L912 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-04-04 18:54:22,643 INFO L913 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-04-04 18:54:22,643 INFO L914 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-04-04 18:54:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-04 18:54:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2022-04-04 18:54:22,685 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-04-04 18:54:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 598 transitions. [2022-04-04 18:54:22,686 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 598 transitions. Word has length 88 [2022-04-04 18:54:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:54:22,686 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 598 transitions. [2022-04-04 18:54:22,686 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-04-04 18:54:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 598 transitions. [2022-04-04 18:54:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-04 18:54:22,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:54:22,688 INFO L499 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-04-04 18:54:22,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-04 18:54:22,688 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:54:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:54:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2091129168, now seen corresponding path program 3 times [2022-04-04 18:54:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:54:22,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591507799] [2022-04-04 18:54:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:54:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:54:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:54:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 18:54:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-04 18:54:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-04-04 18:54:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:54:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591507799] [2022-04-04 18:54:23,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591507799] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:54:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447812540] [2022-04-04 18:54:23,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-04 18:54:23,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:54:23,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:54:23,160 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-04-04 18:54:23,161 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-04-04 18:54:23,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-04 18:54:23,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 18:54:23,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-04 18:54:23,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:54:23,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-04 18:54:23,377 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-04-04 18:54:23,409 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-04-04 18:54:23,458 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-04-04 18:54:23,485 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-04-04 18:54:23,511 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-04-04 18:54:23,538 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-04-04 18:54:23,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-04 18:54:23,581 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-04-04 18:54:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-04-04 18:54:23,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:54:24,300 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-04-04 18:54:24,325 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-04-04 18:54:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 9 not checked. [2022-04-04 18:54:24,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447812540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:54:24,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:54:24,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 36 [2022-04-04 18:54:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150482087] [2022-04-04 18:54:24,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:54:24,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-04 18:54:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:54:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-04 18:54:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=991, Unknown=2, NotChecked=130, Total=1260 [2022-04-04 18:54:24,386 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-04-04 18:54:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 18:54:25,874 INFO L93 Difference]: Finished difference Result 757 states and 1040 transitions. [2022-04-04 18:54:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-04 18:54:25,874 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-04-04 18:54:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 18:54:25,875 INFO L225 Difference]: With dead ends: 757 [2022-04-04 18:54:25,875 INFO L226 Difference]: Without dead ends: 348 [2022-04-04 18:54:25,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=490, Invalid=2378, Unknown=2, NotChecked=210, Total=3080 [2022-04-04 18:54:25,878 INFO L913 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.3s IncrementalHoareTripleChecker+Time [2022-04-04 18:54:25,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 24 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 579 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2022-04-04 18:54:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-04 18:54:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2022-04-04 18:54:25,912 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-04-04 18:54:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 464 transitions. [2022-04-04 18:54:25,913 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 464 transitions. Word has length 94 [2022-04-04 18:54:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 18:54:25,913 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 464 transitions. [2022-04-04 18:54:25,913 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-04-04 18:54:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 464 transitions. [2022-04-04 18:54:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-04 18:54:25,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 18:54:25,914 INFO L499 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-04-04 18:54:25,930 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-04-04 18:54:26,120 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-04-04 18:54:26,121 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 18:54:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 18:54:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 332347090, now seen corresponding path program 4 times [2022-04-04 18:54:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 18:54:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995570068] [2022-04-04 18:54:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 18:54:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 18:54:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 18:54:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:26,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 18:54:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 18:54:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-04 18:54:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 18:54:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 46 proven. 183 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-04 18:54:27,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 18:54:27,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995570068] [2022-04-04 18:54:27,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995570068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 18:54:27,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43755890] [2022-04-04 18:54:27,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-04 18:54:27,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 18:54:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 18:54:27,177 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-04-04 18:54:27,193 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-04-04 18:54:27,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-04 18:54:27,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 18:54:27,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-04 18:54:27,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 18:54:27,679 INFO L356 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2022-04-04 18:54:27,680 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-04-04 18:54:27,879 INFO L356 Elim1Store]: treesize reduction 228, result has 8.8 percent of original size [2022-04-04 18:54:27,880 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-04-04 18:54:27,995 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-04 18:54:27,995 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-04-04 18:54:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 55 proven. 168 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-04 18:54:28,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 18:54:37,434 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-04-04 18:54:37,488 INFO L356 Elim1Store]: treesize reduction 81, result has 52.1 percent of original size [2022-04-04 18:54:37,488 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-04-04 18:54:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 152 proven. 53 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-04 18:54:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43755890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 18:54:37,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 18:54:37,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 21, 16] total 68 [2022-04-04 18:54:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782730943] [2022-04-04 18:54:37,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 18:54:37,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-04 18:54:37,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 18:54:37,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-04 18:54:37,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=4265, Unknown=3, NotChecked=0, Total=4556 [2022-04-04 18:54:37,869 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-04-04 18:56:33,560 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 59 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-04 18:56:55,530 WARN L232 SmtUtils]: Spent 9.09s 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-04-04 18:57:41,191 WARN L232 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-04 18:58:15,214 WARN L232 SmtUtils]: Spent 18.21s 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-04-04 18:58:33,490 WARN L232 SmtUtils]: Spent 18.19s 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-04-04 18:59:02,698 WARN L232 SmtUtils]: Spent 5.71s 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-04-04 18:59:59,811 WARN L232 SmtUtils]: Spent 18.19s 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-04-04 19:00:22,725 WARN L232 SmtUtils]: Spent 18.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-04-04 19:01:09,287 WARN L232 SmtUtils]: Spent 18.19s 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-04-04 19:01:29,558 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-04-04 19:01:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:01:47,634 INFO L93 Difference]: Finished difference Result 1782 states and 2468 transitions. [2022-04-04 19:01:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 474 states. [2022-04-04 19:01:47,635 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-04-04 19:01:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:01:47,642 INFO L225 Difference]: With dead ends: 1782 [2022-04-04 19:01:47,642 INFO L226 Difference]: Without dead ends: 1530 [2022-04-04 19:01:47,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 196 SyntacticMatches, 6 SemanticMatches, 530 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121388 ImplicationChecksByTransitivity, 436.4s TimeCoverageRelationStatistics Valid=16442, Invalid=265972, Unknown=78, NotChecked=0, Total=282492 [2022-04-04 19:01:47,661 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 992 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4650 mSolverCounterSat, 1348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1348 IncrementalHoareTripleChecker+Valid, 4650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4347 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-04 19:01:47,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 127 Invalid, 10345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1348 Valid, 4650 Invalid, 0 Unknown, 4347 Unchecked, 2.9s Time] [2022-04-04 19:01:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-04-04 19:01:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 860. [2022-04-04 19:01:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 848 states have (on average 1.4056603773584906) internal successors, (1192), 849 states have internal predecessors, (1192), 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-04-04 19:01:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1203 transitions. [2022-04-04 19:01:47,817 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1203 transitions. Word has length 94 [2022-04-04 19:01:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:01:47,817 INFO L478 AbstractCegarLoop]: Abstraction has 860 states and 1203 transitions. [2022-04-04 19:01:47,817 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-04-04 19:01:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1203 transitions. [2022-04-04 19:01:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-04 19:01:47,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:01:47,819 INFO L499 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-04-04 19:01:47,834 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-04-04 19:01:48,021 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-04-04 19:01:48,022 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 19:01:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:01:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1911636208, now seen corresponding path program 5 times [2022-04-04 19:01:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:01:48,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545238890] [2022-04-04 19:01:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:01:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:01:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:01:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 19:01:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 19:01:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-04 19:01:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-04-04 19:01:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:01:48,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545238890] [2022-04-04 19:01:48,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545238890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:01:48,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139504593] [2022-04-04 19:01:48,551 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-04 19:01:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:01:48,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:01:48,552 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-04-04 19:01:48,553 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-04-04 19:01:48,752 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-04 19:01:48,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 19:01:48,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-04 19:01:48,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 19:01:48,791 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-04 19:01:48,791 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-04-04 19:01:48,858 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-04-04 19:01:48,912 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:48,912 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-04-04 19:01:48,956 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:48,956 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-04-04 19:01:49,338 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-04-04 19:01:49,645 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-04 19:01:49,645 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-04-04 19:01:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-04 19:01:49,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 19:01:49,913 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-04-04 19:01:49,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139504593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:01:49,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-04 19:01:49,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2022-04-04 19:01:49,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120631876] [2022-04-04 19:01:49,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-04 19:01:49,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-04 19:01:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:01:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-04 19:01:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1421, Unknown=11, NotChecked=76, Total=1640 [2022-04-04 19:01:49,916 INFO L87 Difference]: Start difference. First operand 860 states and 1203 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-04-04 19:01:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:01:51,404 INFO L93 Difference]: Finished difference Result 1667 states and 2343 transitions. [2022-04-04 19:01:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-04 19:01:51,405 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-04-04 19:01:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:01:51,408 INFO L225 Difference]: With dead ends: 1667 [2022-04-04 19:01:51,408 INFO L226 Difference]: Without dead ends: 838 [2022-04-04 19:01:51,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=397, Invalid=3842, Unknown=55, NotChecked=128, Total=4422 [2022-04-04 19:01:51,410 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-04 19:01:51,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 211 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 875 Invalid, 0 Unknown, 198 Unchecked, 0.4s Time] [2022-04-04 19:01:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-04 19:01:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 836. [2022-04-04 19:01:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 822 states have (on average 1.405109489051095) internal successors, (1155), 823 states have internal predecessors, (1155), 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-04-04 19:01:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1168 transitions. [2022-04-04 19:01:51,595 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1168 transitions. Word has length 94 [2022-04-04 19:01:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:01:51,595 INFO L478 AbstractCegarLoop]: Abstraction has 836 states and 1168 transitions. [2022-04-04 19:01:51,596 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-04-04 19:01:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1168 transitions. [2022-04-04 19:01:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-04 19:01:51,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:01:51,597 INFO L499 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-04-04 19:01:51,614 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-04-04 19:01:51,811 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-04-04 19:01:51,811 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 19:01:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:01:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1699502714, now seen corresponding path program 6 times [2022-04-04 19:01:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:01:51,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198405531] [2022-04-04 19:01:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:01:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:01:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:01:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 19:01:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:52,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 19:01:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:52,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-04 19:01:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-04 19:01:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 7 proven. 181 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-04 19:01:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:01:52,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198405531] [2022-04-04 19:01:52,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198405531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:01:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427651021] [2022-04-04 19:01:52,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-04 19:01:52,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:01:52,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:01:52,691 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-04-04 19:01:52,692 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-04-04 19:01:52,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-04 19:01:52,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 19:01:52,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-04 19:01:52,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 19:01:52,934 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-04 19:01:52,934 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-04-04 19:01:52,993 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-04-04 19:01:53,065 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:53,066 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-04-04 19:01:53,112 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-04-04 19:01:53,113 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-04-04 19:01:53,194 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-04-04 19:01:53,195 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-04-04 19:01:53,774 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-04-04 19:01:54,714 INFO L356 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-04-04 19:01:54,715 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-04-04 19:01:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-04 19:01:54,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 19:01:55,097 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-04-04 19:01:55,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427651021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:01:55,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-04 19:01:55,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-04-04 19:01:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118067398] [2022-04-04 19:01:55,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-04 19:01:55,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-04 19:01:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:01:55,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-04 19:01:55,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2367, Unknown=14, NotChecked=98, Total=2652 [2022-04-04 19:01:55,100 INFO L87 Difference]: Start difference. First operand 836 states and 1168 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-04-04 19:01:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:01:57,408 INFO L93 Difference]: Finished difference Result 1629 states and 2284 transitions. [2022-04-04 19:01:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-04 19:01:57,418 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-04-04 19:01:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:01:57,420 INFO L225 Difference]: With dead ends: 1629 [2022-04-04 19:01:57,421 INFO L226 Difference]: Without dead ends: 869 [2022-04-04 19:01:57,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 110 SyntacticMatches, 13 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=515, Invalid=7100, Unknown=45, NotChecked=172, Total=7832 [2022-04-04 19:01:57,422 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-04 19:01:57,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 313 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 680 Invalid, 0 Unknown, 482 Unchecked, 0.4s Time] [2022-04-04 19:01:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-04-04 19:01:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 860. [2022-04-04 19:01:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 844 states have (on average 1.3992890995260663) internal successors, (1181), 845 states have internal predecessors, (1181), 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-04-04 19:01:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1196 transitions. [2022-04-04 19:01:57,571 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1196 transitions. Word has length 102 [2022-04-04 19:01:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:01:57,571 INFO L478 AbstractCegarLoop]: Abstraction has 860 states and 1196 transitions. [2022-04-04 19:01:57,571 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-04-04 19:01:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1196 transitions. [2022-04-04 19:01:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-04 19:01:57,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:01:57,573 INFO L499 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-04-04 19:01:57,593 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-04-04 19:01:57,777 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-04-04 19:01:57,777 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 19:01:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:01:57,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1203177028, now seen corresponding path program 7 times [2022-04-04 19:01:57,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:01:57,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487651109] [2022-04-04 19:01:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:01:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:01:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:01:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 19:01:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:58,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 19:01:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-04 19:01:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-04 19:01:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:58,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-04 19:01:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 123 proven. 92 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-04 19:01:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:01:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487651109] [2022-04-04 19:01:58,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487651109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:01:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181463007] [2022-04-04 19:01:58,439 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-04 19:01:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:01:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:01:58,440 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-04-04 19:01:58,440 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-04-04 19:01:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:01:58,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-04 19:01:58,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 19:01:58,583 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-04 19:01:58,583 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-04-04 19:01:58,612 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-04-04 19:01:58,708 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:58,709 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-04-04 19:01:58,759 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:58,759 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-04-04 19:01:58,806 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:58,807 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-04-04 19:01:58,856 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-04 19:01:58,856 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-04-04 19:01:59,281 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-04-04 19:01:59,936 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-04 19:01:59,936 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-04-04 19:02:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 9 proven. 163 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-04-04 19:02:00,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 19:02:00,340 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-04-04 19:02:00,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181463007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:02:00,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-04 19:02:00,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 46 [2022-04-04 19:02:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256867887] [2022-04-04 19:02:00,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-04 19:02:00,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-04 19:02:00,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:02:00,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-04 19:02:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2559, Unknown=11, NotChecked=102, Total=2862 [2022-04-04 19:02:00,343 INFO L87 Difference]: Start difference. First operand 860 states and 1196 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-04-04 19:02:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:02:03,344 INFO L93 Difference]: Finished difference Result 1856 states and 2613 transitions. [2022-04-04 19:02:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-04 19:02:03,345 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-04-04 19:02:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:02:03,347 INFO L225 Difference]: With dead ends: 1856 [2022-04-04 19:02:03,347 INFO L226 Difference]: Without dead ends: 1177 [2022-04-04 19:02:03,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 142 SyntacticMatches, 14 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=829, Invalid=10627, Unknown=104, NotChecked=212, Total=11772 [2022-04-04 19:02:03,350 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 138 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-04 19:02:03,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 270 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1193 Invalid, 0 Unknown, 181 Unchecked, 0.6s Time] [2022-04-04 19:02:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-04-04 19:02:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1023. [2022-04-04 19:02:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.407960199004975) internal successors, (1415), 1006 states have internal predecessors, (1415), 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-04-04 19:02:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1432 transitions. [2022-04-04 19:02:03,548 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1432 transitions. Word has length 110 [2022-04-04 19:02:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:02:03,548 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1432 transitions. [2022-04-04 19:02:03,548 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-04-04 19:02:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1432 transitions. [2022-04-04 19:02:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-04 19:02:03,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:02:03,550 INFO L499 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-04-04 19:02:03,569 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-04-04 19:02:03,763 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-04-04 19:02:03,763 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-04 19:02:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:02:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash -611444882, now seen corresponding path program 8 times [2022-04-04 19:02:03,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:02:03,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794383216] [2022-04-04 19:02:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:02:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:02:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:02:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-04 19:02:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-04 19:02:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-04 19:02:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-04 19:02:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-04 19:02:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-04 19:02:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:02:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-04-04 19:02:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:02:03,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794383216] [2022-04-04 19:02:03,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794383216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:02:03,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170945048] [2022-04-04 19:02:03,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-04 19:02:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:02:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:02:03,847 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-04-04 19:02:03,848 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-04-04 19:02:03,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-04 19:02:03,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-04 19:02:03,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-04 19:02:03,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 19:02:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-04-04 19:02:04,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-04 19:02:04,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170945048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:02:04,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-04 19:02:04,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2022-04-04 19:02:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065855051] [2022-04-04 19:02:04,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:02:04,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-04 19:02:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:02:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-04 19:02:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-04 19:02:04,073 INFO L87 Difference]: Start difference. First operand 1023 states and 1432 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-04-04 19:02:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:02:04,267 INFO L93 Difference]: Finished difference Result 1026 states and 1435 transitions. [2022-04-04 19:02:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-04 19:02:04,268 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-04-04 19:02:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:02:04,268 INFO L225 Difference]: With dead ends: 1026 [2022-04-04 19:02:04,268 INFO L226 Difference]: Without dead ends: 0 [2022-04-04 19:02:04,269 INFO L912 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-04-04 19:02:04,270 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:02:04,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:02:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-04 19:02:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-04 19:02:04,271 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-04-04 19:02:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-04 19:02:04,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-04-04 19:02:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:02:04,271 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-04 19:02:04,271 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-04-04 19:02:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-04 19:02:04,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-04 19:02:04,273 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-04 19:02:04,306 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-04-04 19:02:04,487 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-04-04 19:02:04,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-04 19:02:09,514 WARN L232 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 472 DAG size of output: 433 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-04 19:04:47,231 WARN L232 SmtUtils]: Spent 2.63m on a formula simplification. DAG size of input: 1143 DAG size of output: 1086 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-04 19:05:10,427 WARN L232 SmtUtils]: Spent 20.59s on a formula simplification. DAG size of input: 1074 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 40 52) no Hoare annotation was computed. [2022-04-04 19:05:10,990 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-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 40 52) no Hoare annotation was computed. [2022-04-04 19:05:10,990 INFO L882 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-04-04 19:05:10,990 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-04-04 19:05:10,991 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-04-04 19:05:10,991 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-04-04 19:05:10,991 INFO L882 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-04-04 19:05:10,992 INFO L882 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-04-04 19:05:10,993 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-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2022-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-04 19:05:10,993 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-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point SelectionSortEXIT(lines 26 38) no Hoare annotation was computed. [2022-04-04 19:05:10,993 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-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-04-04 19:05:10,993 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-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2022-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2022-04-04 19:05:10,993 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-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point L30-4(lines 26 38) no Hoare annotation was computed. [2022-04-04 19:05:10,993 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-04 19:05:10,994 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-04-04 19:05:10,994 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-04 19:05:10,994 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-04 19:05:10,994 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-04 19:05:10,994 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-04 19:05:10,994 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-04 19:05:10,994 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-04 19:05:10,994 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-04 19:05:10,994 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-04 19:05:10,996 INFO L719 BasicCegarLoop]: Path program histogram: [8, 4, 2, 1, 1, 1, 1] [2022-04-04 19:05:10,997 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-04 19:05:11,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-04-04 19:05:11,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-04-04 19:05:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 07:05:11 BoogieIcfgContainer [2022-04-04 19:05:11,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-04 19:05:11,020 INFO L158 Benchmark]: Toolchain (without parser) took 765392.16ms. Allocated memory was 191.9MB in the beginning and 549.5MB in the end (delta: 357.6MB). Free memory was 134.2MB in the beginning and 207.1MB in the end (delta: -72.9MB). Peak memory consumption was 355.6MB. Max. memory is 8.0GB. [2022-04-04 19:05:11,021 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-04 19:05:11,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.08ms. Allocated memory was 191.9MB in the beginning and 263.2MB in the end (delta: 71.3MB). Free memory was 134.0MB in the beginning and 235.0MB in the end (delta: -101.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-04 19:05:11,021 INFO L158 Benchmark]: Boogie Preprocessor took 47.02ms. Allocated memory is still 263.2MB. Free memory was 235.0MB in the beginning and 233.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-04 19:05:11,021 INFO L158 Benchmark]: RCFGBuilder took 280.23ms. Allocated memory is still 263.2MB. Free memory was 232.9MB in the beginning and 220.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-04 19:05:11,021 INFO L158 Benchmark]: TraceAbstraction took 764830.79ms. Allocated memory was 263.2MB in the beginning and 549.5MB in the end (delta: 286.3MB). Free memory was 220.3MB in the beginning and 207.1MB in the end (delta: 13.2MB). Peak memory consumption was 370.4MB. Max. memory is 8.0GB. [2022-04-04 19:05:11,022 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.09ms. Allocated memory is still 191.9MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.08ms. Allocated memory was 191.9MB in the beginning and 263.2MB in the end (delta: 71.3MB). Free memory was 134.0MB in the beginning and 235.0MB in the end (delta: -101.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.02ms. Allocated memory is still 263.2MB. Free memory was 235.0MB in the beginning and 233.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.23ms. Allocated memory is still 263.2MB. Free memory was 232.9MB in the beginning and 220.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 764830.79ms. Allocated memory was 263.2MB in the beginning and 549.5MB in the end (delta: 286.3MB). Free memory was 220.3MB in the beginning and 207.1MB in the end (delta: 13.2MB). Peak memory consumption was 370.4MB. 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: 764.7s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 540.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 186.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2792 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2777 mSDsluCounter, 1668 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6265 IncrementalHoareTripleChecker+Unchecked, 1215 mSDsCounter, 2466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12780 IncrementalHoareTripleChecker+Invalid, 21511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2466 mSolverCounterUnsat, 453 mSDtfsCounter, 12780 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2929 GetRequests, 1558 SyntacticMatches, 65 SemanticMatches, 1306 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 137170 ImplicationChecksByTransitivity, 552.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=17, InterpolantAutomatonStates: 942, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1035 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 64 PreInvPairs, 715 NumberOfFragments, 1790 HoareAnnotationTreeSize, 64 FomulaSimplifications, 189015 FormulaSimplificationTreeSizeReduction, 162.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 308204 FormulaSimplificationTreeSizeReductionInter, 23.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 32.2s 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-04-04 19:05:11,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_351,QUANTIFIED] [2022-04-04 19:05:11,027 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-04-04 19:05:11,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_79,QUANTIFIED] [2022-04-04 19:05:11,031 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-04-04 19:05:11,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_812,QUANTIFIED] [2022-04-04 19:05:11,032 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-04-04 19:05:11,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...