/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/forester-heap/dll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:51:05,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:51:05,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:51:05,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:51:05,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:51:05,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:51:05,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:51:05,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:51:05,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:51:05,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:51:05,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:51:05,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:51:05,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:51:05,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:51:05,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:51:05,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:51:05,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:51:05,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:51:05,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:51:05,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:51:05,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:51:05,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:51:05,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:51:05,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:51:05,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:51:05,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:51:05,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:51:05,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:51:05,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:51:05,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:51:05,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:51:05,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:51:05,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:51:05,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:51:05,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:51:05,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:51:05,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:51:05,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:51:05,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:51:05,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:51:05,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:51:05,294 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:51:05,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:51:05,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:51:05,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:51:05,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:51:05,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:51:05,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:51:05,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:51:05,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:51:05,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:51:05,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:05,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:51:05,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:51:05,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:51:05,310 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:51:05,310 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:51:05,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:51:05,310 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:51:05,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:51:05,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:51:05,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:51:05,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:51:05,495 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:51:05,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional-1.i [2022-01-10 00:51:05,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9f7824b/fd4ef7405d6b410bbd9aa203fc7e7792/FLAG86966b855 [2022-01-10 00:51:05,980 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:51:05,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-optional-1.i [2022-01-10 00:51:06,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9f7824b/fd4ef7405d6b410bbd9aa203fc7e7792/FLAG86966b855 [2022-01-10 00:51:06,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9f7824b/fd4ef7405d6b410bbd9aa203fc7e7792 [2022-01-10 00:51:06,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:51:06,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:51:06,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:06,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:51:06,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:51:06,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c355172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06, skipping insertion in model container [2022-01-10 00:51:06,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:51:06,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:51:06,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-optional-1.i[22753,22766] [2022-01-10 00:51:06,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:06,786 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:51:06,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-optional-1.i[22753,22766] [2022-01-10 00:51:06,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:06,849 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:51:06,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06 WrapperNode [2022-01-10 00:51:06,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:06,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:06,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:51:06,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:51:06,854 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:51:06" (1/1) ... [2022-01-10 00:51:06,865 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:51:06" (1/1) ... [2022-01-10 00:51:06,881 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2022-01-10 00:51:06,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:06,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:51:06,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:51:06,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:51:06,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:51:06,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:51:06,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:51:06,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:51:06,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (1/1) ... [2022-01-10 00:51:06,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:06,928 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:51:06,933 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:51:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:51:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:51:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:51:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:51:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:51:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:51:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:51:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:51:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:51:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:51:07,021 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:51:07,022 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:51:07,255 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:51:07,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:51:07,259 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 00:51:07,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:07 BoogieIcfgContainer [2022-01-10 00:51:07,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:51:07,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:51:07,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:51:07,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:51:07,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:06" (1/3) ... [2022-01-10 00:51:07,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd35e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:07, skipping insertion in model container [2022-01-10 00:51:07,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:06" (2/3) ... [2022-01-10 00:51:07,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd35e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:07, skipping insertion in model container [2022-01-10 00:51:07,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:07" (3/3) ... [2022-01-10 00:51:07,265 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-01-10 00:51:07,268 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:51:07,269 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:51:07,304 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:51:07,311 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:51:07,311 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:51:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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:51:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:51:07,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:07,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:07,348 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2022-01-10 00:51:07,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:07,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572174347] [2022-01-10 00:51:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:07,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:07,489 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:51:07,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:07,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572174347] [2022-01-10 00:51:07,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572174347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:07,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:07,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:51:07,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717710703] [2022-01-10 00:51:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:07,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:51:07,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:07,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:51:07,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:51:07,520 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:51:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:07,534 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-01-10 00:51:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:51:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-01-10 00:51:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:07,541 INFO L225 Difference]: With dead ends: 51 [2022-01-10 00:51:07,541 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 00:51:07,546 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:51:07,548 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:51:07,549 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:51:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 00:51:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 00:51:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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:51:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-01-10 00:51:07,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-01-10 00:51:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:07,574 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-01-10 00:51:07,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:51:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-01-10 00:51:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:51:07,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:07,575 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:51:07,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:51:07,576 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2022-01-10 00:51:07,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:07,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425386530] [2022-01-10 00:51:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:07,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:07,675 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:51:07,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:07,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425386530] [2022-01-10 00:51:07,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425386530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:07,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:07,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:07,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450750970] [2022-01-10 00:51:07,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:07,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:07,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:07,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:07,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:07,678 INFO L87 Difference]: Start difference. First operand 22 states and 30 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:51:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:07,700 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-01-10 00:51:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:07,700 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:51:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:07,701 INFO L225 Difference]: With dead ends: 37 [2022-01-10 00:51:07,701 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 00:51:07,701 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:51:07,702 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:07,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 00:51:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 00:51:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-01-10 00:51:07,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-01-10 00:51:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:07,706 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-01-10 00:51:07,706 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:51:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-01-10 00:51:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:51:07,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:07,706 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:51:07,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:51:07,707 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2022-01-10 00:51:07,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:07,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128131793] [2022-01-10 00:51:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:07,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:07,845 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:51:07,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128131793] [2022-01-10 00:51:07,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128131793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:07,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:07,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:51:07,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991315312] [2022-01-10 00:51:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:07,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:07,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:07,851 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:51:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,013 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-01-10 00:51:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:51:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:51:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,014 INFO L225 Difference]: With dead ends: 41 [2022-01-10 00:51:08,014 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 00:51:08,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:51:08,015 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 00:51:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-01-10 00:51:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-01-10 00:51:08,019 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2022-01-10 00:51:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,019 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-01-10 00:51:08,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:51:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-01-10 00:51:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:51:08,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,020 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:51:08,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:51:08,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2022-01-10 00:51:08,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109097576] [2022-01-10 00:51:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,119 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:51:08,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109097576] [2022-01-10 00:51:08,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109097576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:08,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:08,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:51:08,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517087657] [2022-01-10 00:51:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:08,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:51:08,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:51:08,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:51:08,121 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:51:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,310 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-01-10 00:51:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 00:51:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:51:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,311 INFO L225 Difference]: With dead ends: 93 [2022-01-10 00:51:08,311 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 00:51:08,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-01-10 00:51:08,313 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 79 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 00:51:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-01-10 00:51:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-01-10 00:51:08,318 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2022-01-10 00:51:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,318 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-01-10 00:51:08,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:51:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-01-10 00:51:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:51:08,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,319 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:51:08,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:51:08,319 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2022-01-10 00:51:08,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770386809] [2022-01-10 00:51:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,374 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:51:08,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770386809] [2022-01-10 00:51:08,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770386809] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:08,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:08,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:51:08,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950662044] [2022-01-10 00:51:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:08,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:08,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:08,376 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:51:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,468 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-01-10 00:51:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:51:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:51:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,469 INFO L225 Difference]: With dead ends: 87 [2022-01-10 00:51:08,469 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 00:51:08,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:51:08,470 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 73 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 00:51:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2022-01-10 00:51:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 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:51:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-01-10 00:51:08,474 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2022-01-10 00:51:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,475 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-01-10 00:51:08,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:51:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-01-10 00:51:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 00:51:08,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:08,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:51:08,476 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2022-01-10 00:51:08,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911193650] [2022-01-10 00:51:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,523 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:51:08,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911193650] [2022-01-10 00:51:08,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911193650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:08,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:08,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:51:08,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164311703] [2022-01-10 00:51:08,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:08,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:08,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:08,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:08,524 INFO L87 Difference]: Start difference. First operand 40 states and 51 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:51:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,668 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-01-10 00:51:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 00:51:08,669 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:51:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,669 INFO L225 Difference]: With dead ends: 105 [2022-01-10 00:51:08,669 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 00:51:08,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-01-10 00:51:08,670 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 00:51:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2022-01-10 00:51:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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:51:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-10 00:51:08,675 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2022-01-10 00:51:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,675 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-10 00:51:08,675 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:51:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-10 00:51:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 00:51:08,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:08,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:51:08,676 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2022-01-10 00:51:08,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281222099] [2022-01-10 00:51:08,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,741 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:51:08,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281222099] [2022-01-10 00:51:08,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281222099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:08,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:08,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:08,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657604778] [2022-01-10 00:51:08,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:08,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:08,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:08,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:08,742 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:51:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,856 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-01-10 00:51:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:51:08,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:51:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,857 INFO L225 Difference]: With dead ends: 84 [2022-01-10 00:51:08,857 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 00:51:08,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:51:08,860 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 00:51:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2022-01-10 00:51:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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:51:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-10 00:51:08,878 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2022-01-10 00:51:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,878 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-10 00:51:08,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:51:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-10 00:51:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 00:51:08,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,878 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:08,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:51:08,879 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2022-01-10 00:51:08,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690250032] [2022-01-10 00:51:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:09,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:09,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690250032] [2022-01-10 00:51:09,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690250032] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:09,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175396114] [2022-01-10 00:51:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:09,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:09,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:09,212 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:51:09,213 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:51:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 87 conjunts are in the unsatisfiable core [2022-01-10 00:51:09,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:09,356 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:51:09,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,382 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 00:51:09,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,388 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 00:51:09,393 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 10 treesize of output 9 [2022-01-10 00:51:09,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2022-01-10 00:51:09,412 INFO L353 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-01-10 00:51:09,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2022-01-10 00:51:09,417 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 0 case distinctions, treesize of input 34 treesize of output 28 [2022-01-10 00:51:09,422 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 14 treesize of output 13 [2022-01-10 00:51:09,425 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 10 treesize of output 9 [2022-01-10 00:51:09,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,572 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2022-01-10 00:51:09,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,595 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 00:51:09,596 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 65 [2022-01-10 00:51:09,628 INFO L353 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-01-10 00:51:09,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 111 [2022-01-10 00:51:09,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:09,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-01-10 00:51:09,672 INFO L353 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2022-01-10 00:51:09,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 57 [2022-01-10 00:51:09,679 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 30 treesize of output 28 [2022-01-10 00:51:09,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,833 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 00:51:09,833 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 100 [2022-01-10 00:51:09,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:09,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2022-01-10 00:51:09,869 INFO L353 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2022-01-10 00:51:09,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2022-01-10 00:51:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:10,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_471) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_467)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_466) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_468)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (and (= 0 (select (select .cse0 .cse1) .cse2)) (= (select (select .cse3 .cse1) .cse2) 0)) (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_7|) 0)))))) is different from false [2022-01-10 00:51:11,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_464 Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_464)))) (let ((.cse6 (select (select (store .cse5 v_ArrVal_464 v_ArrVal_448) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) v_ArrVal_464 v_ArrVal_458) .cse6 v_ArrVal_471) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_467)) (.cse3 (store (store (store .cse5 v_ArrVal_464 v_ArrVal_453) .cse6 v_ArrVal_466) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_468)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select (store |c_#valid| v_ArrVal_464 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|) 0)) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select |c_#valid| v_ArrVal_464))) (and (= (select (select .cse2 .cse0) .cse1) 0) (= (select (select .cse3 .cse0) .cse1) 0)))))))) is different from false [2022-01-10 00:51:15,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_464 Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_24| Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_464)))) (let ((.cse6 (select (select (store .cse5 v_ArrVal_464 v_ArrVal_448) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_464 v_ArrVal_458) .cse6 v_ArrVal_471) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_467)) (.cse3 (store (store (store .cse5 v_ArrVal_464 v_ArrVal_453) .cse6 v_ArrVal_466) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_468)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (store |c_#valid| v_ArrVal_464 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|) 0)) (and (= (select (select .cse2 .cse1) .cse0) 0) (= (select (select .cse3 .cse1) .cse0) 0)) (not (= 0 (select |c_#valid| v_ArrVal_464))))))))) is different from false [2022-01-10 00:51:15,864 INFO L353 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-01-10 00:51:15,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1812 treesize of output 1666 [2022-01-10 00:51:15,990 INFO L353 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-01-10 00:51:15,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2957 treesize of output 2019 [2022-01-10 00:51:16,700 INFO L353 Elim1Store]: treesize reduction 140, result has 66.7 percent of original size [2022-01-10 00:51:16,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70028929 treesize of output 69046245 [2022-01-10 00:51:39,948 WARN L228 SmtUtils]: Spent 23.23s on a formula simplification that was a NOOP. DAG size: 9353 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-10 00:52:02,609 WARN L228 SmtUtils]: Spent 22.63s on a formula simplification that was a NOOP. DAG size: 9350 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)