/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:49:39,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:49:39,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:49:40,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:49:40,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:49:40,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:49:40,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:49:40,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:49:40,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:49:40,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:49:40,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:49:40,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:49:40,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:49:40,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:49:40,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:49:40,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:49:40,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:49:40,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:49:40,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:49:40,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:49:40,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:49:40,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:49:40,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:49:40,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:49:40,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:49:40,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:49:40,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:49:40,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:49:40,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:49:40,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:49:40,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:49:40,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:49:40,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:49:40,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:49:40,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:49:40,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:49:40,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:49:40,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:49:40,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:49:40,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:49:40,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:49:40,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:49:40,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:49:40,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:49:40,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:49:40,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:49:40,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:49:40,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:49:40,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:49:40,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:49:40,092 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:49:40,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:49:40,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:49:40,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:49:40,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:49:40,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:49:40,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:40,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:49:40,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:49:40,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:49:40,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:49:40,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:49:40,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:49:40,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:49:40,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:49:40,095 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-01-10 00:49:40,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:49:40,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:49:40,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:49:40,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:49:40,329 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:49:40,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 00:49:40,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8665a814/0ed09595996e4eb6bdcaefce2c049e12/FLAG7abb9144b [2022-01-10 00:49:40,749 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:49:40,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 00:49:40,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8665a814/0ed09595996e4eb6bdcaefce2c049e12/FLAG7abb9144b [2022-01-10 00:49:40,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8665a814/0ed09595996e4eb6bdcaefce2c049e12 [2022-01-10 00:49:40,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:49:40,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:49:40,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:40,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:49:40,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:49:40,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:40" (1/1) ... [2022-01-10 00:49:40,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d62a9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:40, skipping insertion in model container [2022-01-10 00:49:40,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:40" (1/1) ... [2022-01-10 00:49:40,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:49:40,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:49:41,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 00:49:41,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:41,078 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:49:41,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 00:49:41,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:41,134 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:49:41,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41 WrapperNode [2022-01-10 00:49:41,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:41,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:41,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:49:41,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:49:41,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,185 INFO L137 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2022-01-10 00:49:41,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:41,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:49:41,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:49:41,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:49:41,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:49:41,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:49:41,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:49:41,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:49:41,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (1/1) ... [2022-01-10 00:49:41,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:41,240 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-01-10 00:49:41,256 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-01-10 00:49:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-01-10 00:49:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-01-10 00:49:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:49:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:49:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:49:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:49:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:49:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:49:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:49:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:49:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:49:41,404 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:49:41,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:49:41,442 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-01-10 00:49:41,590 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:49:41,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:49:41,594 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 00:49:41,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:41 BoogieIcfgContainer [2022-01-10 00:49:41,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:49:41,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:49:41,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:49:41,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:49:41,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:49:40" (1/3) ... [2022-01-10 00:49:41,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8ff9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:41, skipping insertion in model container [2022-01-10 00:49:41,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:41" (2/3) ... [2022-01-10 00:49:41,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8ff9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:41, skipping insertion in model container [2022-01-10 00:49:41,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:41" (3/3) ... [2022-01-10 00:49:41,606 INFO L111 eAbstractionObserver]: Analyzing ICFG splice-2.i [2022-01-10 00:49:41,609 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:49:41,610 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:49:41,646 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:49:41,651 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:49:41,651 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:49:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 00:49:41,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:41,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:41,675 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2022-01-10 00:49:41,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:41,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477684808] [2022-01-10 00:49:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:41,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:41,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:41,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477684808] [2022-01-10 00:49:41,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477684808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:41,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:41,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:49:41,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866691775] [2022-01-10 00:49:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:41,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:49:41,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:49:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:49:41,814 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-10 00:49:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:41,829 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-01-10 00:49:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:49:41,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 00:49:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:41,835 INFO L225 Difference]: With dead ends: 48 [2022-01-10 00:49:41,835 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 00:49:41,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:49:41,841 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:41,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 00:49:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 00:49:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-01-10 00:49:41,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-01-10 00:49:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:41,863 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-01-10 00:49:41,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-10 00:49:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-01-10 00:49:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 00:49:41,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:41,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:41,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:49:41,865 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2022-01-10 00:49:41,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:41,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541096036] [2022-01-10 00:49:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:41,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:41,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:41,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541096036] [2022-01-10 00:49:41,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541096036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:41,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:41,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:49:41,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528207677] [2022-01-10 00:49:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:41,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:49:41,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:49:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:49:41,959 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-01-10 00:49:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:42,010 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-01-10 00:49:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:49:42,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 00:49:42,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:42,011 INFO L225 Difference]: With dead ends: 40 [2022-01-10 00:49:42,012 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 00:49:42,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 00:49:42,015 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:42,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 00:49:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-01-10 00:49:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-01-10 00:49:42,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-01-10 00:49:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:42,021 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-01-10 00:49:42,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-01-10 00:49:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-01-10 00:49:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:49:42,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:42,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:42,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:49:42,022 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2022-01-10 00:49:42,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:42,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642366537] [2022-01-10 00:49:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:42,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:42,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:42,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642366537] [2022-01-10 00:49:42,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642366537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:42,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:42,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:49:42,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663058591] [2022-01-10 00:49:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:42,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:49:42,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:49:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:49:42,103 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-01-10 00:49:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:42,159 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-01-10 00:49:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:49:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 00:49:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:42,161 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:49:42,161 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 00:49:42,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 00:49:42,162 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:42,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 00:49:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-01-10 00:49:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-01-10 00:49:42,166 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-01-10 00:49:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:42,166 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-01-10 00:49:42,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-01-10 00:49:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-01-10 00:49:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 00:49:42,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:42,167 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:42,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:49:42,168 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2022-01-10 00:49:42,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825560149] [2022-01-10 00:49:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:42,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:42,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:42,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825560149] [2022-01-10 00:49:42,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825560149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:42,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:42,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:49:42,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691664604] [2022-01-10 00:49:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:42,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:49:42,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:49:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:49:42,228 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:42,327 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-01-10 00:49:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:49:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 00:49:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:42,328 INFO L225 Difference]: With dead ends: 70 [2022-01-10 00:49:42,328 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:49:42,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:49:42,329 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:42,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:49:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:49:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-01-10 00:49:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-01-10 00:49:42,332 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2022-01-10 00:49:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:42,333 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-01-10 00:49:42,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-01-10 00:49:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 00:49:42,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:42,333 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:42,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:49:42,334 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:42,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2022-01-10 00:49:42,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:42,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533936682] [2022-01-10 00:49:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:42,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:42,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:42,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533936682] [2022-01-10 00:49:42,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533936682] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:42,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920325316] [2022-01-10 00:49:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:42,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:42,585 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-01-10 00:49:42,640 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-01-10 00:49:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:42,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 00:49:42,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:42,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:49:42,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:49:42,856 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:42,856 INFO L387 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-01-10 00:49:42,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:42,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 00:49:42,920 INFO L387 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-01-10 00:49:42,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:42,965 INFO L387 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 21 treesize of output 20 [2022-01-10 00:49:43,005 INFO L387 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 15 treesize of output 7 [2022-01-10 00:49:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:43,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:43,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-01-10 00:49:43,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 Int) (v_ArrVal_102 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_98)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-01-10 00:49:43,129 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 00:49:43,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-01-10 00:49:43,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:43,138 INFO L387 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 30 treesize of output 33 [2022-01-10 00:49:43,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-10 00:49:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 00:49:43,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920325316] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:43,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:43,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-01-10 00:49:43,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357784401] [2022-01-10 00:49:43,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:43,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 00:49:43,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 00:49:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2022-01-10 00:49:43,266 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:47,815 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2022-01-10 00:49:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 00:49:47,815 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 00:49:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:47,816 INFO L225 Difference]: With dead ends: 138 [2022-01-10 00:49:47,816 INFO L226 Difference]: Without dead ends: 105 [2022-01-10 00:49:47,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=293, Invalid=1514, Unknown=7, NotChecked=166, Total=1980 [2022-01-10 00:49:47,818 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:47,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 259 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 344 Invalid, 0 Unknown, 165 Unchecked, 0.2s Time] [2022-01-10 00:49:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-10 00:49:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2022-01-10 00:49:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 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-01-10 00:49:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-01-10 00:49:47,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2022-01-10 00:49:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:47,828 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-01-10 00:49:47,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-01-10 00:49:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:49:47,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:47,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:47,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 00:49:48,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:48,046 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1115102530, now seen corresponding path program 1 times [2022-01-10 00:49:48,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:48,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120349305] [2022-01-10 00:49:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:48,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:48,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:48,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120349305] [2022-01-10 00:49:48,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120349305] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:48,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657555407] [2022-01-10 00:49:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:48,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:48,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:48,102 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-01-10 00:49:48,110 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-01-10 00:49:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:48,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:49:48,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:49:48,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:49:48,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657555407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:48,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:49:48,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 00:49:48,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224876142] [2022-01-10 00:49:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:48,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:49:48,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:49:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:49:48,208 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:48,217 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-01-10 00:49:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:49:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 00:49:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:48,218 INFO L225 Difference]: With dead ends: 115 [2022-01-10 00:49:48,218 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 00:49:48,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:49:48,219 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:48,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 00:49:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-01-10 00:49:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 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-01-10 00:49:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-01-10 00:49:48,224 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 25 [2022-01-10 00:49:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:48,224 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-01-10 00:49:48,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-01-10 00:49:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:49:48,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:48,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:48,243 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-01-10 00:49:48,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 00:49:48,439 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2022-01-10 00:49:48,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:48,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696470183] [2022-01-10 00:49:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:48,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:48,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696470183] [2022-01-10 00:49:48,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696470183] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117503923] [2022-01-10 00:49:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:48,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:48,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:48,576 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-01-10 00:49:48,597 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-01-10 00:49:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:48,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 00:49:48,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:48,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:49:48,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:49:48,715 INFO L387 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 19 treesize of output 7 [2022-01-10 00:49:48,717 INFO L387 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 19 treesize of output 7 [2022-01-10 00:49:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:49:48,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:49:48,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117503923] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:48,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:48,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-01-10 00:49:48,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470462668] [2022-01-10 00:49:48,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:48,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:49:48,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:48,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:49:48,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:49:48,768 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:48,898 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-01-10 00:49:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 00:49:48,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 00:49:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:48,899 INFO L225 Difference]: With dead ends: 83 [2022-01-10 00:49:48,899 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 00:49:48,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-01-10 00:49:48,900 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:48,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 111 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:49:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 00:49:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-01-10 00:49:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-01-10 00:49:48,905 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 25 [2022-01-10 00:49:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:48,905 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-01-10 00:49:48,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-01-10 00:49:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:49:48,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:48,906 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:48,940 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-01-10 00:49:49,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:49,123 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2022-01-10 00:49:49,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:49,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734880963] [2022-01-10 00:49:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:49,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:49,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:49,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734880963] [2022-01-10 00:49:49,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734880963] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:49,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743854507] [2022-01-10 00:49:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:49,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:49,312 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-01-10 00:49:49,348 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-01-10 00:49:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:49,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-10 00:49:49,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:49,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:49:49,475 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:49,475 INFO L387 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-01-10 00:49:49,511 INFO L387 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 13 treesize of output 9 [2022-01-10 00:49:49,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:49:49,574 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:49:49,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-01-10 00:49:49,578 INFO L387 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 42 treesize of output 44 [2022-01-10 00:49:49,580 INFO L387 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 29 treesize of output 19 [2022-01-10 00:49:49,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:49,683 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-01-10 00:49:49,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:49,686 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2022-01-10 00:49:49,711 INFO L387 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-01-10 00:49:49,743 INFO L387 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 15 treesize of output 7 [2022-01-10 00:49:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:49,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:49,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-01-10 00:49:49,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-01-10 00:49:49,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2022-01-10 00:49:49,850 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:49,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-01-10 00:49:49,857 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:49,857 INFO L387 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 75 treesize of output 78 [2022-01-10 00:49:49,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2022-01-10 00:49:49,891 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-01-10 00:49:49,923 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:49,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-10 00:49:49,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:49,929 INFO L387 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 36 treesize of output 39 [2022-01-10 00:49:49,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:49:49,948 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-10 00:49:49,948 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-01-10 00:49:49,954 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-10 00:49:49,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-01-10 00:49:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-10 00:49:50,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743854507] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:50,091 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:50,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-01-10 00:49:50,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54132753] [2022-01-10 00:49:50,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:50,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 00:49:50,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 00:49:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=741, Unknown=4, NotChecked=228, Total=1056 [2022-01-10 00:49:50,093 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:50,698 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-01-10 00:49:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:49:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 00:49:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:50,699 INFO L225 Difference]: With dead ends: 103 [2022-01-10 00:49:50,699 INFO L226 Difference]: Without dead ends: 76 [2022-01-10 00:49:50,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=1777, Unknown=4, NotChecked=356, Total=2352 [2022-01-10 00:49:50,701 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:50,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 320 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 420 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-01-10 00:49:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-10 00:49:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-01-10 00:49:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 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-01-10 00:49:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-01-10 00:49:50,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2022-01-10 00:49:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:50,705 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-01-10 00:49:50,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-01-10 00:49:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 00:49:50,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:50,706 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:50,725 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-01-10 00:49:50,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:50,907 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:50,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash -154506453, now seen corresponding path program 2 times [2022-01-10 00:49:50,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311295898] [2022-01-10 00:49:50,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:50,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:49:50,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:50,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311295898] [2022-01-10 00:49:50,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311295898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:50,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:50,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:49:50,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724298928] [2022-01-10 00:49:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:50,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:49:50,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:49:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:50,945 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:50,971 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2022-01-10 00:49:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:49:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 00:49:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:50,972 INFO L225 Difference]: With dead ends: 126 [2022-01-10 00:49:50,972 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 00:49:50,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:50,972 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:50,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 00:49:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-01-10 00:49:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-01-10 00:49:50,976 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2022-01-10 00:49:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:50,976 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-01-10 00:49:50,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-01-10 00:49:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 00:49:50,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:50,977 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:50,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:49:50,977 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2022-01-10 00:49:50,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:50,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93506570] [2022-01-10 00:49:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:50,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:51,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93506570] [2022-01-10 00:49:51,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93506570] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635242122] [2022-01-10 00:49:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:51,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:51,366 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-01-10 00:49:51,399 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-01-10 00:49:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:51,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 00:49:51,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:51,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:49:51,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:49:51,573 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:51,573 INFO L387 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-01-10 00:49:51,597 INFO L387 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 19 treesize of output 18 [2022-01-10 00:49:51,600 INFO L387 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-01-10 00:49:51,655 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:49:51,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-01-10 00:49:51,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:51,663 INFO L387 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-01-10 00:49:51,730 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:49:51,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-10 00:49:51,734 INFO L387 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 18 treesize of output 20 [2022-01-10 00:49:51,792 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:49:51,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-01-10 00:49:51,802 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 00:49:51,805 INFO L387 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 19 treesize of output 22 [2022-01-10 00:49:51,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 00:49:52,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:52,048 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-01-10 00:49:52,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:52,109 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:49:52,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 00:49:52,191 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 00:49:52,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-01-10 00:49:52,255 INFO L387 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 15 treesize of output 7 [2022-01-10 00:49:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:52,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:52,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2022-01-10 00:49:52,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|))) is different from false [2022-01-10 00:49:52,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1)) is different from false [2022-01-10 00:49:52,288 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2022-01-10 00:49:52,295 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) is different from false [2022-01-10 00:49:52,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_459))) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-01-10 00:49:52,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_56| Int) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_56|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_56| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-01-10 00:49:52,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_56| Int) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_56|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_56| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-01-10 00:49:52,449 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:52,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 111 [2022-01-10 00:49:52,471 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:52,472 INFO L387 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 820 treesize of output 817 [2022-01-10 00:49:52,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 798 treesize of output 782 [2022-01-10 00:49:52,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 774 [2022-01-10 00:49:57,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_56| Int) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse7 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse10 |v_ULTIMATE.start_main_~p~0#1.base_56|) 0 3))))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (= |v_ULTIMATE.start_main_~p~0#1.base_56| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (and .cse0 (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_56|) 0 3))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (and (let ((.cse6 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (forall ((v_arrayElimCell_45 Int)) (= (select (select (store (let ((.cse4 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_56|) 0 3))))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse6) (and (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse8 v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not .cse6)))) (not .cse0)) (and (= .cse8 .cse9) (not (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_42)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from false [2022-01-10 00:50:23,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:50:23,217 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:50:23,217 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 203 [2022-01-10 00:50:23,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:50:23,246 INFO L387 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 1037 treesize of output 1025 [2022-01-10 00:50:23,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:50:23,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 983 treesize of output 951 [2022-01-10 00:50:23,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 941 treesize of output 893 [2022-01-10 00:50:24,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:50:24,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-10 00:50:24,843 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:50:25,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:50:25,311 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:50:25,312 INFO L387 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 98 treesize of output 102 [2022-01-10 00:50:25,374 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:50:25,408 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:50:25,425 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:50:25,445 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:50:25,464 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:50:25,556 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:50:25,559 INFO L387 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 160 treesize of output 152 [2022-01-10 00:50:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-01-10 00:50:25,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635242122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:25,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:25,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2022-01-10 00:50:25,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144527280] [2022-01-10 00:50:25,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:25,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-10 00:50:25,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:25,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-10 00:50:25,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1124, Unknown=21, NotChecked=684, Total=1980 [2022-01-10 00:50:25,901 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 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-01-10 00:50:26,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_56| Int) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_56|) 0 3))))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_56| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-01-10 00:50:26,049 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_56| Int) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_56|) 0 3))))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_56| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-01-10 00:50:26,053 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_56| Int) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_56| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_56|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_56| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-01-10 00:50:28,064 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_459))) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-01-10 00:50:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:28,252 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-01-10 00:50:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 00:50:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 00:50:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:28,254 INFO L225 Difference]: With dead ends: 77 [2022-01-10 00:50:28,254 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 00:50:28,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 13 IntricatePredicates, 2 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=215, Invalid=1618, Unknown=25, NotChecked=1222, Total=3080 [2022-01-10 00:50:28,256 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:28,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 146 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 310 Unchecked, 0.1s Time] [2022-01-10 00:50:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 00:50:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-01-10 00:50:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 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-01-10 00:50:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-01-10 00:50:28,267 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 32 [2022-01-10 00:50:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:28,268 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-01-10 00:50:28,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 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-01-10 00:50:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-01-10 00:50:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 00:50:28,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:28,282 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:28,302 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-01-10 00:50:28,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 00:50:28,482 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2060333054, now seen corresponding path program 1 times [2022-01-10 00:50:28,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:28,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174514577] [2022-01-10 00:50:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:28,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:28,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:28,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174514577] [2022-01-10 00:50:28,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174514577] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:28,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124723497] [2022-01-10 00:50:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:28,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:28,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:28,526 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-01-10 00:50:28,526 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-01-10 00:50:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:28,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 00:50:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:28,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:28,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124723497] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:28,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:28,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-01-10 00:50:28,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309483044] [2022-01-10 00:50:28,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:28,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:50:28,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:50:28,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:50:28,705 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-01-10 00:50:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:28,785 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-01-10 00:50:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 00:50:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 00:50:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:28,786 INFO L225 Difference]: With dead ends: 90 [2022-01-10 00:50:28,786 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 00:50:28,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 00:50:28,787 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:28,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 64 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:50:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 00:50:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-01-10 00:50:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:50:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-01-10 00:50:28,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 34 [2022-01-10 00:50:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:28,801 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-01-10 00:50:28,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-01-10 00:50:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-01-10 00:50:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 00:50:28,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:28,801 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:28,820 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-01-10 00:50:29,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:29,018 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2062043076, now seen corresponding path program 1 times [2022-01-10 00:50:29,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34824937] [2022-01-10 00:50:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:29,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:50:29,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:29,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34824937] [2022-01-10 00:50:29,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34824937] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:29,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355914485] [2022-01-10 00:50:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:29,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:29,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:29,439 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-01-10 00:50:29,440 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-01-10 00:50:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:29,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 00:50:29,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:29,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:50:29,658 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-01-10 00:50:29,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-01-10 00:50:29,726 INFO L353 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-01-10 00:50:29,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 00:50:29,736 INFO L353 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-01-10 00:50:29,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 00:50:29,836 INFO L387 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 19 treesize of output 7 [2022-01-10 00:50:29,838 INFO L387 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 19 treesize of output 7 [2022-01-10 00:50:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 00:50:29,843 INFO L328 TraceCheckSpWp]: Computing backward predicates...