./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:05:15,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:05:16,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:05:16,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:05:16,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:05:16,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:05:16,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:05:16,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:05:16,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:05:16,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:05:16,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:05:16,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:05:16,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:05:16,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:05:16,063 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:05:16,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:05:16,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:05:16,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:05:16,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:05:16,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:05:16,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:05:16,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:05:16,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:05:16,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:05:16,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:05:16,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:05:16,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:05:16,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:05:16,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:05:16,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:05:16,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:05:16,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:05:16,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:05:16,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:05:16,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:05:16,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:05:16,071 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2024-10-11 14:05:16,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:05:16,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:05:16,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:05:16,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:05:16,276 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:05:16,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-10-11 14:05:17,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:05:17,635 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:05:17,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-10-11 14:05:17,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/69c75fd12/703f4fc1bf4c403780f3acec25e8c36e/FLAG548c48d19 [2024-10-11 14:05:18,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/69c75fd12/703f4fc1bf4c403780f3acec25e8c36e [2024-10-11 14:05:18,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:05:18,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:05:18,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:05:18,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:05:18,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:05:18,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20143e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18, skipping insertion in model container [2024-10-11 14:05:18,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:05:18,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-10-11 14:05:18,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:05:18,308 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:05:18,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-10-11 14:05:18,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:05:18,368 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:05:18,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18 WrapperNode [2024-10-11 14:05:18,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:05:18,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:05:18,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:05:18,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:05:18,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,415 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2024-10-11 14:05:18,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:05:18,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:05:18,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:05:18,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:05:18,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,451 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-11 14:05:18,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:05:18,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:05:18,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:05:18,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:05:18,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (1/1) ... [2024-10-11 14:05:18,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:05:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:05:18,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:05:18,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:05:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:05:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:05:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:05:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:05:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:05:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:05:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:05:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:05:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:05:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:05:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:05:18,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:05:18,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:05:19,044 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-11 14:05:19,044 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:05:19,077 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:05:19,078 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:05:19,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:05:19 BoogieIcfgContainer [2024-10-11 14:05:19,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:05:19,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:05:19,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:05:19,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:05:19,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:05:18" (1/3) ... [2024-10-11 14:05:19,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39519bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:05:19, skipping insertion in model container [2024-10-11 14:05:19,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:18" (2/3) ... [2024-10-11 14:05:19,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39519bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:05:19, skipping insertion in model container [2024-10-11 14:05:19,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:05:19" (3/3) ... [2024-10-11 14:05:19,086 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2024-10-11 14:05:19,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:05:19,117 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:05:19,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:05:19,179 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67964f2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:05:19,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:05:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:19,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:19,196 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:19,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:19,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1340131898, now seen corresponding path program 1 times [2024-10-11 14:05:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000744892] [2024-10-11 14:05:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000744892] [2024-10-11 14:05:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000744892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:05:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831985150] [2024-10-11 14:05:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:19,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:05:19,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:05:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:05:19,583 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:05:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:19,621 INFO L93 Difference]: Finished difference Result 209 states and 329 transitions. [2024-10-11 14:05:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:05:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-11 14:05:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:19,629 INFO L225 Difference]: With dead ends: 209 [2024-10-11 14:05:19,629 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 14:05:19,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:05:19,639 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:19,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:05:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 14:05:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 14:05:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-11 14:05:19,671 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2024-10-11 14:05:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:19,671 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-11 14:05:19,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:05:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-11 14:05:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:19,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:19,674 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:19,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:05:19,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:19,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash 86622116, now seen corresponding path program 1 times [2024-10-11 14:05:19,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:19,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237808703] [2024-10-11 14:05:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237808703] [2024-10-11 14:05:19,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237808703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:19,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:19,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:05:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760866887] [2024-10-11 14:05:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:19,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:05:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:19,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:05:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:05:19,989 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:05:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:20,042 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2024-10-11 14:05:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:05:20,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-11 14:05:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:20,044 INFO L225 Difference]: With dead ends: 209 [2024-10-11 14:05:20,044 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 14:05:20,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:05:20,045 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:20,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:05:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 14:05:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 14:05:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-10-11 14:05:20,058 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 148 [2024-10-11 14:05:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:20,060 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-10-11 14:05:20,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:05:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-10-11 14:05:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:20,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:20,062 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:20,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:05:20,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:20,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2045196902, now seen corresponding path program 1 times [2024-10-11 14:05:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262758498] [2024-10-11 14:05:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:20,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262758498] [2024-10-11 14:05:20,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262758498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:20,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:20,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:05:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330422370] [2024-10-11 14:05:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:20,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:05:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:20,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:05:20,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:05:20,277 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:05:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:20,320 INFO L93 Difference]: Finished difference Result 214 states and 309 transitions. [2024-10-11 14:05:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:05:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-11 14:05:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:20,323 INFO L225 Difference]: With dead ends: 214 [2024-10-11 14:05:20,323 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 14:05:20,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:05:20,326 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 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 [2024-10-11 14:05:20,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:05:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 14:05:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-11 14:05:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-10-11 14:05:20,340 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 148 [2024-10-11 14:05:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:20,340 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-10-11 14:05:20,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:05:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-10-11 14:05:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:20,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:20,346 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:20,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:05:20,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:20,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2045256484, now seen corresponding path program 1 times [2024-10-11 14:05:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021144342] [2024-10-11 14:05:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 14:05:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021144342] [2024-10-11 14:05:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021144342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:05:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578937943] [2024-10-11 14:05:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:05:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:05:22,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:05:22,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:05:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:22,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 14:05:22,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:05:22,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:05:23,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:23,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:23,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:23,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:23,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:24,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:24,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:24,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:24,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:25,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:25,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:25,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:05:25,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 14:05:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 52 proven. 193 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-10-11 14:05:25,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:05:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578937943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:05:25,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:05:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2024-10-11 14:05:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695303899] [2024-10-11 14:05:25,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:05:25,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 14:05:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 14:05:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:05:25,200 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 20 states, 18 states have (on average 5.777777777777778) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-11 14:05:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:25,774 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2024-10-11 14:05:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:05:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.777777777777778) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 148 [2024-10-11 14:05:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:25,775 INFO L225 Difference]: With dead ends: 222 [2024-10-11 14:05:25,775 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 14:05:25,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-10-11 14:05:25,777 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 253 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:25,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 598 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:05:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 14:05:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-11 14:05:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-10-11 14:05:25,792 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 148 [2024-10-11 14:05:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:25,793 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-10-11 14:05:25,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.777777777777778) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-11 14:05:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-10-11 14:05:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:25,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:25,794 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:25,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:05:25,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:05:25,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:25,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:25,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1227608034, now seen corresponding path program 1 times [2024-10-11 14:05:25,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:25,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266815895] [2024-10-11 14:05:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266815895] [2024-10-11 14:05:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266815895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:32,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:32,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 14:05:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740429334] [2024-10-11 14:05:32,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:32,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:05:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:05:32,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:05:32,292 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:05:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:34,202 INFO L93 Difference]: Finished difference Result 277 states and 389 transitions. [2024-10-11 14:05:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:05:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-10-11 14:05:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:34,204 INFO L225 Difference]: With dead ends: 277 [2024-10-11 14:05:34,204 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 14:05:34,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:05:34,205 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 461 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:34,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 581 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:05:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 14:05:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2024-10-11 14:05:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2024-10-11 14:05:34,227 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 148 [2024-10-11 14:05:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:34,228 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2024-10-11 14:05:34,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:05:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2024-10-11 14:05:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:34,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:34,231 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:34,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:05:34,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:34,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 216490784, now seen corresponding path program 1 times [2024-10-11 14:05:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:34,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235002027] [2024-10-11 14:05:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235002027] [2024-10-11 14:05:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235002027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:05:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831958411] [2024-10-11 14:05:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:37,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:05:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:05:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:05:37,174 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:05:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:37,908 INFO L93 Difference]: Finished difference Result 293 states and 410 transitions. [2024-10-11 14:05:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:05:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-10-11 14:05:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:37,911 INFO L225 Difference]: With dead ends: 293 [2024-10-11 14:05:37,912 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 14:05:37,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:05:37,913 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:37,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 503 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:05:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 14:05:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2024-10-11 14:05:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2024-10-11 14:05:37,935 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 148 [2024-10-11 14:05:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:37,936 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2024-10-11 14:05:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:05:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2024-10-11 14:05:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:37,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:37,937 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:37,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:05:37,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1289647648, now seen corresponding path program 1 times [2024-10-11 14:05:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364947754] [2024-10-11 14:05:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:40,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364947754] [2024-10-11 14:05:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364947754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:40,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:05:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544625770] [2024-10-11 14:05:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:40,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:05:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:05:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:05:40,503 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:05:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:41,248 INFO L93 Difference]: Finished difference Result 297 states and 414 transitions. [2024-10-11 14:05:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:05:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-10-11 14:05:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:41,250 INFO L225 Difference]: With dead ends: 297 [2024-10-11 14:05:41,250 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 14:05:41,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:05:41,251 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 322 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:41,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 474 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:05:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 14:05:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-10-11 14:05:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 183 transitions. [2024-10-11 14:05:41,276 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 183 transitions. Word has length 148 [2024-10-11 14:05:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 183 transitions. [2024-10-11 14:05:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:05:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 183 transitions. [2024-10-11 14:05:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 14:05:41,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:41,278 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:05:41,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 278530398, now seen corresponding path program 1 times [2024-10-11 14:05:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695343874] [2024-10-11 14:05:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:05:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695343874] [2024-10-11 14:05:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695343874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:47,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:47,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:05:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44754964] [2024-10-11 14:05:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:05:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:47,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:05:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:05:47,461 INFO L87 Difference]: Start difference. First operand 132 states and 183 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:05:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:49,420 INFO L93 Difference]: Finished difference Result 299 states and 415 transitions. [2024-10-11 14:05:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:05:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-11 14:05:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:49,422 INFO L225 Difference]: With dead ends: 299 [2024-10-11 14:05:49,422 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 14:05:49,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:05:49,422 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 253 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:49,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 805 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:05:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 14:05:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-10-11 14:05:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:05:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 183 transitions. [2024-10-11 14:05:49,440 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 183 transitions. Word has length 148 [2024-10-11 14:05:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 183 transitions. [2024-10-11 14:05:49,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:05:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 183 transitions. [2024-10-11 14:05:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 14:05:49,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:49,443 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:05:49,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:49,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 826996775, now seen corresponding path program 1 times [2024-10-11 14:05:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101285146] [2024-10-11 14:05:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:05:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 14:05:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101285146] [2024-10-11 14:05:50,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101285146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:05:50,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146500783] [2024-10-11 14:05:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:05:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:05:50,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:05:50,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:05:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:50,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 14:05:50,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:05:52,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:05:53,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:05:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:53,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:05:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:53,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:05:53,885 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 57 treesize of output 43 [2024-10-11 14:05:53,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2024-10-11 14:05:53,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:53,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 22 [2024-10-11 14:05:54,036 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 110 treesize of output 82 [2024-10-11 14:05:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:54,071 INFO L349 Elim1Store]: treesize reduction 74, result has 26.7 percent of original size [2024-10-11 14:05:54,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 114 [2024-10-11 14:05:54,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:54,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:54,336 INFO L349 Elim1Store]: treesize reduction 128, result has 37.6 percent of original size [2024-10-11 14:05:54,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 82 treesize of output 144 [2024-10-11 14:05:54,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 209 [2024-10-11 14:05:54,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:54,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:56,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:05:56,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 170 case distinctions, treesize of input 206 treesize of output 1504 [2024-10-11 14:05:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 136 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-10-11 14:05:56,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:05:56,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse1 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (< .cse1 0) (not (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (< 32767 .cse1) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse3 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256)))))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse4 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse4))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse5 (store .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse5 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< .cse4 0) (= (mod (select (select .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (< 32767 .cse4)))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse7 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse7))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse8 (store .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse8 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (= (mod (select (select .cse9 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (< 0 (+ .cse7 1)) (< (+ .cse7 32768) 0)))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse10 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse11 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse10))) (not (= (mod (select (select .cse11 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (< 0 (+ .cse10 1)) (< (+ .cse10 32768) 0) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse12 (store .cse11 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse12 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256)))))))) is different from false [2024-10-11 14:05:57,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse1 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse3 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse2 (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 0 (+ .cse1 1)) (< (+ .cse1 32768) 0) (= (mod (select (select .cse3 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse6 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse8 (store .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store (select .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse6))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse7 (store .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse7 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< .cse6 0) (< 32767 .cse6) (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse12 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse10 (store .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse9 (store .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= v_ArrVal_697 (store (select .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse12))) (< 0 (+ .cse12 1)) (< (+ .cse12 32768) 0) (not (= (mod (select (select .cse10 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse16 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse14 (store .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse13 (store .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse13 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= v_ArrVal_697 (store (select .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse16))) (< .cse16 0) (< 32767 .cse16) (not (= (mod (select (select .cse14 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))))) is different from false [2024-10-11 14:05:57,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse1 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (< .cse1 0) (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse3 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 32767 .cse1))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse6 (let ((.cse10 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse8 (store .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse7 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store (select .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse7))) (not (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse9 (store .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 0 (+ .cse7 1)) (< (+ .cse7 32768) 0))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse11 (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse15 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse13 (store .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse12 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store (select .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse12))) (< .cse12 0) (not (= (mod (select (select .cse13 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse14 (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse14 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse14 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 32767 .cse12))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse16 (let ((.cse20 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse20 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse20 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse17 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse18 (store .cse16 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store (select .cse16 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse17))) (= (mod (select (select .cse18 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (< 0 (+ .cse17 1)) (< (+ .cse17 32768) 0) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse19 (store .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse19 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse19 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))))))))) is different from false [2024-10-11 14:05:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146500783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:05:57,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:05:57,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2024-10-11 14:05:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506254150] [2024-10-11 14:05:57,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:05:57,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 14:05:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:57,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 14:05:57,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=684, Unknown=3, NotChecked=168, Total=992 [2024-10-11 14:05:57,636 INFO L87 Difference]: Start difference. First operand 132 states and 183 transitions. Second operand has 26 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2024-10-11 14:06:02,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:06,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:10,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:14,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:18,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:22,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:23,423 INFO L93 Difference]: Finished difference Result 395 states and 541 transitions. [2024-10-11 14:06:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 14:06:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 150 [2024-10-11 14:06:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:23,426 INFO L225 Difference]: With dead ends: 395 [2024-10-11 14:06:23,427 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 14:06:23,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=327, Invalid=1164, Unknown=3, NotChecked=228, Total=1722 [2024-10-11 14:06:23,428 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 914 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 225 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:23,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 663 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1235 Invalid, 6 Unknown, 0 Unchecked, 25.1s Time] [2024-10-11 14:06:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 14:06:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 219. [2024-10-11 14:06:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 180 states have internal predecessors, (233), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 14:06:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 301 transitions. [2024-10-11 14:06:23,475 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 301 transitions. Word has length 150 [2024-10-11 14:06:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:23,475 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 301 transitions. [2024-10-11 14:06:23,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2024-10-11 14:06:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 301 transitions. [2024-10-11 14:06:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 14:06:23,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:23,477 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:06:23,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:06:23,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:23,678 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:23,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:23,678 INFO L85 PathProgramCache]: Analyzing trace with hash 807756876, now seen corresponding path program 1 times [2024-10-11 14:06:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:06:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684930813] [2024-10-11 14:06:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:06:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:06:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11777597] [2024-10-11 14:06:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:06:23,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:06:23,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:06:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:23,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 14:06:23,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:24,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:06:25,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:06:25,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:06:25,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 14:06:26,406 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 24 [2024-10-11 14:06:26,733 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 24 [2024-10-11 14:06:27,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:06:27,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:06:27,041 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 24 [2024-10-11 14:06:27,128 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 24 [2024-10-11 14:06:27,194 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 65 treesize of output 49 [2024-10-11 14:06:27,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 77 [2024-10-11 14:06:27,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2024-10-11 14:06:27,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-11 14:06:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 163 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-10-11 14:06:27,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:06:27,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse1 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse2 (select (select .cse3 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (not (= v_ArrVal_832 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (< (+ .cse1 32768) 0) (< 0 (+ 101 (div .cse2 (mod (select (select .cse3 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)))) (< 0 (+ .cse1 1)) (< .cse2 0))))) (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse4 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse5 (select (select .cse7 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse6 (mod (select (select .cse7 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (not (= v_ArrVal_832 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse4))) (< 0 (+ (div .cse5 .cse6) 102)) (< (+ .cse4 32768) 0) (< 0 (+ .cse4 1)) (< 0 (+ .cse5 1)) (= (mod .cse5 .cse6) 0))))) (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse8 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse9 (select (select .cse11 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse10 (mod (select (select .cse11 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (not (= v_ArrVal_832 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse8))) (< (+ .cse8 32768) 0) (< 0 (+ 101 (div .cse9 .cse10))) (< 0 (+ .cse8 1)) (not (= (mod .cse9 .cse10) 0)))))) (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse12 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse13 (select (select .cse15 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse14 (mod (select (select .cse15 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (not (= v_ArrVal_832 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse12))) (< 32767 .cse12) (< 0 (+ (div .cse13 .cse14) 102)) (< .cse12 0) (< 0 (+ .cse13 1)) (= (mod .cse13 .cse14) 0))))) (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse16 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse17 (select (select .cse18 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (not (= v_ArrVal_832 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse16))) (< 32767 .cse16) (< .cse16 0) (< 0 (+ 101 (div .cse17 (mod (select (select .cse18 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)))) (< .cse17 0))))) (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse19 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse20 (select (select .cse22 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse21 (mod (select (select .cse22 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (not (= v_ArrVal_832 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse19))) (< 32767 .cse19) (< .cse19 0) (< 0 (+ 101 (div .cse20 .cse21))) (not (= (mod .cse20 .cse21) 0)))))))) is different from false [2024-10-11 14:06:27,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830)))) (let ((.cse3 (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse0 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse2 (select (select .cse3 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< 32767 .cse0) (< .cse0 0) (not (= v_ArrVal_832 (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse0))) (< 0 (+ 101 (div .cse2 (mod (select (select .cse3 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)))) (< .cse2 0)))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830)))) (let ((.cse9 (store .cse7 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse8 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse5 (select (select .cse9 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse6 (mod (select (select .cse9 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (< 0 (+ 102 (div .cse5 .cse6))) (not (= v_ArrVal_832 (store (select .cse7 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse8))) (< 0 (+ .cse5 1)) (< (+ .cse8 32768) 0) (< 0 (+ .cse8 1)) (= (mod .cse5 .cse6) 0)))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830)))) (let ((.cse14 (store .cse13 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse10 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse11 (select (select .cse14 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse12 (mod (select (select .cse14 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (< 32767 .cse10) (< .cse10 0) (< 0 (+ 102 (div .cse11 .cse12))) (not (= v_ArrVal_832 (store (select .cse13 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse10))) (< 0 (+ .cse11 1)) (= (mod .cse11 .cse12) 0)))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830)))) (let ((.cse19 (store .cse18 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse17 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse15 (select (select .cse19 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse16 (mod (select (select .cse19 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536))) (or (not (= (mod .cse15 .cse16) 0)) (< 32767 .cse17) (< .cse17 0) (not (= v_ArrVal_832 (store (select .cse18 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse17))) (< 0 (+ 101 (div .cse15 .cse16)))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830)))) (let ((.cse24 (store .cse22 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse20 (select (select .cse24 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse21 (mod (select (select .cse24 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)) (.cse23 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= (mod .cse20 .cse21) 0)) (not (= v_ArrVal_832 (store (select .cse22 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse23))) (< (+ .cse23 32768) 0) (< 0 (+ 101 (div .cse20 .cse21))) (< 0 (+ .cse23 1))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830)))) (let ((.cse28 (store .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse26 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse27 (select (select .cse28 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (not (= v_ArrVal_832 (store (select .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse26))) (< (+ .cse26 32768) 0) (< 0 (+ 101 (div .cse27 (mod (select (select .cse28 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)))) (< 0 (+ .cse26 1)) (< .cse27 0)))))))) is different from false [2024-10-11 14:06:28,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int)) (v_ArrVal_829 Int)) (let ((.cse3 (let ((.cse4 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_829)))) (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830))))) (let ((.cse2 (store .cse3 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse1 (select (select .cse2 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse0 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (< 32767 .cse0) (< .cse0 0) (< .cse1 0) (< 0 (+ 101 (div .cse1 (mod (select (select .cse2 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)))) (not (= v_ArrVal_832 (store (select .cse3 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse0)))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int)) (v_ArrVal_829 Int)) (let ((.cse9 (let ((.cse11 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_829)))) (store .cse11 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830))))) (let ((.cse10 (store .cse9 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse7 (select (select .cse10 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse8 (mod (select (select .cse10 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)) (.cse6 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (< 32767 .cse6) (< .cse6 0) (< 0 (+ 101 (div .cse7 .cse8))) (not (= (mod .cse7 .cse8) 0)) (not (= v_ArrVal_832 (store (select .cse9 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse6)))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int)) (v_ArrVal_829 Int)) (let ((.cse15 (let ((.cse17 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_829)))) (store .cse17 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830))))) (let ((.cse16 (store .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse14 (mod (select (select .cse16 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)) (.cse12 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse13 (select (select .cse16 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< 32767 .cse12) (< .cse12 0) (= (mod .cse13 .cse14) 0) (< 0 (+ (div .cse13 .cse14) 102)) (not (= v_ArrVal_832 (store (select .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse12))) (< 0 (+ .cse13 1))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int)) (v_ArrVal_829 Int)) (let ((.cse21 (let ((.cse22 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_829)))) (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830))))) (let ((.cse20 (store .cse21 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse18 (select (select .cse20 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse19 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (< .cse18 0) (< (+ .cse19 32768) 0) (< 0 (+ 101 (div .cse18 (mod (select (select .cse20 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)))) (< 0 (+ .cse19 1)) (not (= v_ArrVal_832 (store (select .cse21 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse19)))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int)) (v_ArrVal_829 Int)) (let ((.cse26 (let ((.cse28 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_829)))) (store .cse28 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse28 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830))))) (let ((.cse27 (store .cse26 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse24 (select (select .cse27 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse25 (mod (select (select .cse27 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)) (.cse23 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (< (+ .cse23 32768) 0) (< 0 (+ 101 (div .cse24 .cse25))) (not (= (mod .cse24 .cse25) 0)) (< 0 (+ .cse23 1)) (not (= v_ArrVal_832 (store (select .cse26 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse23)))))))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int)) (v_ArrVal_829 Int)) (let ((.cse32 (let ((.cse34 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_829)))) (store .cse34 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse34 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_830))))) (let ((.cse33 (store .cse32 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_832))) (let ((.cse30 (mod (select (select .cse33 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset) 65536)) (.cse31 (select v_ArrVal_832 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse29 (select (select .cse33 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod .cse29 .cse30) 0) (< 0 (+ (div .cse29 .cse30) 102)) (< (+ .cse31 32768) 0) (< 0 (+ .cse31 1)) (not (= v_ArrVal_832 (store (select .cse32 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse31))) (< 0 (+ .cse29 1))))))))) is different from false [2024-10-11 14:06:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:06:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684930813] [2024-10-11 14:06:28,575 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 14:06:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11777597] [2024-10-11 14:06:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11777597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:06:28,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:06:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-10-11 14:06:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772617749] [2024-10-11 14:06:28,575 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 14:06:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:06:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:06:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:06:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=214, Unknown=3, NotChecked=96, Total=380 [2024-10-11 14:06:28,576 INFO L87 Difference]: Start difference. First operand 219 states and 301 transitions. Second operand has 16 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 6 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-11 14:06:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:29,928 INFO L93 Difference]: Finished difference Result 490 states and 654 transitions. [2024-10-11 14:06:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 14:06:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 6 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) Word has length 152 [2024-10-11 14:06:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:29,932 INFO L225 Difference]: With dead ends: 490 [2024-10-11 14:06:29,932 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 14:06:29,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=420, Unknown=3, NotChecked=138, Total=702 [2024-10-11 14:06:29,933 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 172 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 100 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:29,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 430 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 679 Invalid, 33 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:06:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 14:06:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 239. [2024-10-11 14:06:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 194 states have internal predecessors, (245), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 14:06:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 313 transitions. [2024-10-11 14:06:29,983 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 313 transitions. Word has length 152 [2024-10-11 14:06:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:29,983 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 313 transitions. [2024-10-11 14:06:29,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 6 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-11 14:06:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 313 transitions. [2024-10-11 14:06:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 14:06:29,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:29,985 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:06:29,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:06:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:30,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2135744191, now seen corresponding path program 1 times [2024-10-11 14:06:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:06:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122928416] [2024-10-11 14:06:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:06:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:06:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:06:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:06:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:06:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:06:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:06:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:06:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:06:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:06:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:06:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:06:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:06:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:06:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:06:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:06:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:06:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:06:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:06:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:06:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 14:06:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:06:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122928416] [2024-10-11 14:06:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122928416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:06:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904081218] [2024-10-11 14:06:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:30,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:30,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:06:30,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:06:30,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:06:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:31,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 14:06:31,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:32,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:06:32,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:06:32,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:06:32,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:06:33,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:06:33,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:06:33,078 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 57 treesize of output 43 [2024-10-11 14:06:33,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:06:33,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2024-10-11 14:06:33,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:06:33,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 13 [2024-10-11 14:06:33,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:06:33,186 INFO L378 Elim1Store]: Elim1 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 85 treesize of output 77 [2024-10-11 14:06:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 136 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-10-11 14:06:33,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:06:33,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_967 (Array Int Int))) (let ((.cse1 (select v_ArrVal_967 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_967 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (let ((.cse2 (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_967) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset))) (< .cse2 (+ (* (div .cse2 256) 256) 1))) (< 0 (+ .cse1 1)) (< (+ .cse1 32768) 0)))) (forall ((v_ArrVal_967 (Array Int Int))) (let ((.cse3 (select v_ArrVal_967 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_967 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse3))) (< 32767 .cse3) (let ((.cse4 (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_967) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset))) (< .cse4 (+ (* (div .cse4 256) 256) 1))) (< .cse3 0)))))) is different from false [2024-10-11 14:06:33,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_966 Int)) (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_966))) (.cse0 (select v_ArrVal_967 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (< 32767 .cse0) (let ((.cse1 (select (select (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_967) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset))) (< .cse1 (+ (* (div .cse1 256) 256) 1))) (< .cse0 0) (not (= v_ArrVal_967 (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse0)))))) (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_966 Int)) (let ((.cse5 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_966))) (.cse6 (select v_ArrVal_967 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (let ((.cse4 (select (select (store .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_967) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset))) (< .cse4 (+ (* (div .cse4 256) 256) 1))) (< 0 (+ .cse6 1)) (< (+ .cse6 32768) 0) (not (= v_ArrVal_967 (store (select .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse6)))))))) is different from false [2024-10-11 14:06:33,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_966 Int) (v_ArrVal_963 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_963)))) (store .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_966)))) (.cse0 (select v_ArrVal_967 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (< 32767 .cse0) (let ((.cse1 (select (select (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_967) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset))) (< .cse1 (+ (* 256 (div .cse1 256)) 1))) (not (= v_ArrVal_967 (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse0))) (< .cse0 0)))) (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_966 Int) (v_ArrVal_963 Int)) (let ((.cse6 (let ((.cse8 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_963)))) (store .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_966)))) (.cse7 (select v_ArrVal_967 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (let ((.cse5 (select (select (store .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_967) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset))) (< .cse5 (+ (* 256 (div .cse5 256)) 1))) (not (= v_ArrVal_967 (store (select .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse7))) (< 0 (+ .cse7 1)) (< (+ .cse7 32768) 0)))))) is different from false [2024-10-11 14:06:33,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904081218] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:06:33,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:06:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-10-11 14:06:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156899989] [2024-10-11 14:06:33,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:06:33,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 14:06:33,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:06:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 14:06:33,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=407, Unknown=3, NotChecked=132, Total=650 [2024-10-11 14:06:33,477 INFO L87 Difference]: Start difference. First operand 239 states and 313 transitions. Second operand has 23 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2024-10-11 14:06:37,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]